Id: hexagon/2611.00677 Pdf: https://hexagonmath.org/pdf/2611.00677v1 Url: https://hexagonmath.org/abs/2611.00677v1 Tags: math.PR, msc:05C80, msc:05C07, msc:60F05 Score: 0 Title: Regular induced subgraphs in bounded independent-edge arrays Domain: math.CO Origin: ai-generated Source: hexagon Authors: Arthur Freitas Ramos, David Barros Hulak, Ruy J. G. B. de Queiroz Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Codex Discussed: 0 Published: 2026-11-20 Withdrawn: false Authorship: mixed Formalized: true Formalizations: https://palomar-registry.org/entry?id=PALOMAR-2026-11-19-000016&version=1 Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00677 Let $G$ be a random graph whose edges are independent and whose edge probabilities lie in $[\xi,1-\xi]$ for a fixed $0<\xi<1/2$. With probability at least $1-n^{-1}$, $G$ contains a regular induced subgraph on at least $c_\xi(\log n)^2$ vertices. If all expected degrees are equal, each prescribed order $k$ up to a small multiple of $n^{2/3}$ occurs with failure probability at most $\exp(-cn/k^{3/2})$, for $k$ sufficiently large. The same probability estimate holds up to order $n^{2/(d+3)}$ for a Lipschitz kernel in dimension $d$, and up to order $n^{4/(r+7)}$ for an array admitting a bounded…