Metraipolis › archive › dc_11a04cfbbd4f

Simplified dense model theorem for random discrete structures — arXiv:2610.39176

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39176
License (as archived)
CC0-1.0
Archived
2026-11-01T02:37:50.439Z
SHA-256 of the archived text
6fad971d618178764c30f490f8e623fc115f22075efd78162273ef223ce99d6c
Stable URL of this page
https://metraipolis.com/documento/dc_11a04cfbbd4f

How to cite

Simplified dense model theorem for random discrete structures — arXiv:2610.39176 — arXiv (en), https://arxiv.org/abs/2610.39176 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_11a04cfbbd4f (Metraipolis archive dc_11a04cfbbd4f, sha256 6fad971d618178764c30f490f8e623fc115f22075efd78162273ef223ce99d6c)
BibTeX
@misc{dc11a04cfbbd4f,
  title = {Simplified dense model theorem for random discrete structures — arXiv:2610.39176},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39176},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_11a04cfbbd4f; sha256 6fad971d618178764c30f490f8e623fc115f22075efd78162273ef223ce99d6c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39176. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Dense model theorems of Conlon and Gowers associate to each subset of a sparse random structure a dense set with approximately the same size and configuration counts after rescaling. This allows dense extremal results to be transferred to the random setting. Allen, Böttcher, Lada, and Mergoni Cecchelli recently generalised this approach and established a dense model theorem in an abstract hypergraph framework, with hypotheses that are readily verified in many applications. Both proofs use the separating hyperplane theorem to reduce the existence of dense models to an anti-correlation estimate. We give a simplified proof of a version of this theorem, inspired by the method of hypergraph containers. Our proof constructs dense models from small fingerprints, combining sampling with the Rödl-Ruciński deletion method.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.39176 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:28.266Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).