Metraipolis › archive › dc_47149f14210e
Graph Decompositions at the Expectation Threshold — arXiv:2609.20864
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20864
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:07:21.778Z
- SHA-256 of the archived text
4400d0a2cca0ed18ac64c1d938837e54d2e728edc39715ab1c165e2c74cffc39- Stable URL of this page
https://metraipolis.com/documento/dc_47149f14210e
How to cite
Graph Decompositions at the Expectation Threshold — arXiv:2609.20864 — arXiv (en), https://arxiv.org/abs/2609.20864 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_47149f14210e (Metraipolis archive dc_47149f14210e, sha256 4400d0a2cca0ed18ac64c1d938837e54d2e728edc39715ab1c165e2c74cffc39)
BibTeX
@misc{dc47149f14210e,
title = {Graph Decompositions at the Expectation Threshold — arXiv:2609.20864},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20864},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_47149f14210e; sha256 4400d0a2cca0ed18ac64c1d938837e54d2e728edc39715ab1c165e2c74cffc39},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20864. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For \(n\ge3\) and a graph \(H\) on at most \(n\) vertices, let \(q(H)\) be the expectation threshold for its containment in \(G(n,p)\). We prove that there are absolute constants \(a,L>0\) such that, for every \(C>0\), every graph of degeneracy at most \(C\log n/\log\log n\) has a deterministic edge decomposition into at most \(\lceil a(C+1)\rceil\) pieces, each with ordinary containment threshold at most \(Lq(H)\). This removes the maximum-degree hypothesis from a theorem of Ascoli, He, Park, and Talagrand in their approach to Talagrand's discrete convexity problem. With constants depending on the fixed parameters, a structural extension allows the addition of \(O(\log n)\) vertices with arbitrary incident edges. The uniform main bound also gives an \(O(1+\log\log n)\)-piece decomposition for every target graph, with an absolute threshold multiplier. The main ingredient converts Li's two-set coupling for spread measures into a partition of a prescribed neighborhood list, fixed before the random host is sampled. It allows arbitrary overlaps and repetitions and controls all Hall matching conditions simultaneously by bounding target demand and host supply through common two-sided approximations under the biased host measure. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.PR). Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.20864 — 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-10-10T01:47:50.212Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).