Id: palomar/PALOMAR-2026-11-19-000016 Url: https://github.com/Arthur742Ramos/Math-Formalization/tree/251dd555eb636ac0eddb2387b348bad7f5539894/combinatorics/bounded-independent-edge-regular-subgraphs Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-19-000016-v1.json Repo: https://github.com/Arthur742Ramos/Math-Formalization Tags: math.CO, math.PR, msc:05C80, msc:05C07, msc:60F05 Score: 0 Title: Regular induced subgraphs in bounded independent-edge arrays Trust: high Domain: math.CO Source: palomar Authors: Arthur Freitas Ramos, David Barros Hulak, Ruy Jose Guerra Barretto de Queiroz Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-19 Formalized: true Formalizes: title=Regular induced subgraphs in bounded independent-edge arrays identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-19-000016 Lean formalization of regular induced subgraph bounds for finite random graphs with independent, possibly unequal edge probabilities bounded away from zero and one. The selected theorems give two logarithmic lower bounds, and exact-order guarantees for arrays with equal expected degrees, Lipschitz kernels, and bounded-rank symmetric completions. The library also develops the degree-vector estimates, the overlap second moment, and a product model with matching square-root bounds.