Probabilistic hypergraph containers

Given a k-uniform hypergraph ℋ and sufficiently large m ≫ m₀(ℋ), we show that an m-element set I ⊆ V(ℋ), chosen uniformly at random, with probability 1 − e−^ω(m) is either not independent or is contained in an almost-independent set in ℋ which, crucially, can be constructed from carefully chosen o(m) vertices of I. As a corollary, this implies that if the largest almost-independent set in ℋ is of size o(v(ℋ)) then I itself is an independent set with probability e^−ω(m). More generally, I is very likely to inherit structural properties of almost-independent sets in ℋ.

The value m₀(ℋ) coincides with that for which Janson’s inequality gives that I is independent with probability at most \({e^{- \Theta ({m_0})}}\). On the one hand, our result is a significant strengthening of Janson’s inequality in the range m ≫ m₀. On the other hand, it can be seen as a probabilistic variant of hypergraph container theorems, developed by Balogh, Morris and Samotij and, independently, by Saxton and Thomason. While being strictly weaker than the original container theorems in the sense that it does not apply to all independent sets of size m, it is nonetheless sufficient for many applications and admits a short proof using probabilistic ideas.