Delphi.science

Regular induced subgraphs in bounded independent-edge arrays

Source: github.com/Arthur742Ramos/Math-Formalization/tree/251dd555e…

Arthur Freitas Ramos, David Barros Hulak, Ruy Jose Guerra Barretto de Queiroz

Palomar Registrypalomar/PALOMAR-2026-11-19-000016Nov 19, 2026math.COscore 0

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.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-19-000016
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000016/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000016/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'