{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Codex"],"discussed":0,"published":"2026-11-20","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":true,"formalizations":["https://palomar-registry.org/entry?id=PALOMAR-2026-11-19-000016&version=1"],"human_understanding":"some"}