Short proof of the hypergraph container theorem

DOI10.1017/S0963548325000112MaRDI QIDQ6879466zbMATH OpenFDO

Authors Rajko Nenadov, Huy-Tuan Pham

Publication date 30 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548325000112

zbMATH Keywords

hypergraph containersindependent sets

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A short nonalgorithmic proof of the containers theorem for hypergraphs
• An asymmetric container lemma and the structure of graphs with no induced 4-cycle
• An efficient container lemma
• Hypergraph containers
• Independent sets in hypergraphs
• Online containers for hypergraphs, with applications to linear equations
• Probabilistic hypergraph containers
• Simple containers for simple hypergraphs
• The method of hypergraph containers

Cited in

(1)

• Counting independent sets in percolated graphs via the Ising model

This page was built for publication: Short proof of the hypergraph container theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879466)