A Phase Transition for Small Dense Subhypergraphs

Abstract

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.