Metraipolis › archive › dc_6a564dafbc87
A Phase Transition for Small Dense Subhypergraphs — arXiv:2609.23720
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23720
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:44:54.268Z
- SHA-256 of the archived text
9326bc6b8fc59aa7654b47323e44d951b2660333d0af2ce1bdb9dabc98e2e730- Stable URL of this page
https://metraipolis.com/documento/dc_6a564dafbc87
How to cite
A Phase Transition for Small Dense Subhypergraphs — arXiv:2609.23720 — arXiv (en), https://arxiv.org/abs/2609.23720 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6a564dafbc87 (Metraipolis archive dc_6a564dafbc87, sha256 9326bc6b8fc59aa7654b47323e44d951b2660333d0af2ce1bdb9dabc98e2e730)
BibTeX
@misc{dc6a564dafbc87,
title = {A Phase Transition for Small Dense Subhypergraphs — arXiv:2609.23720},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23720},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6a564dafbc87; sha256 9326bc6b8fc59aa7654b47323e44d951b2660333d0af2ce1bdb9dabc98e2e730},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23720. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The local--global principle, which concerns the relationship between local structure and global parameters, has attracted considerable attention in extremal combinatorics over the past few decades. In this paper, we study how global density forces small dense subhypergraphs in uniform hypergraphs. For fixed $r\ge3$ and $s>1$, let $t_r(n,d,s)$ be the smallest integer $t$ such that every $n$-vertex $r$-graph of average degree at least $d$ contains a nonempty subhypergraph on at most $t$ vertices with average degree at least $s$. We show that the behavior of $t_r(n,d,s)$ undergoes a phase transition at $s=mainr/(r-1)$. We determine $t_r(n,d,s)$ and obtain asymptotically sharp bounds in several parameter regimes. This answers, up to polylogarithmic factors, a question of Feige and Wagner that was later restated as Problem~3.3 by Janzer, Sudakov and Tomon. In particular, when $r=3$ and $s=2$, our result implies a conjecture of Feige. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.23720 — 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-09T21:26:41.130Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).