Probabilistic hypergraph containers

DOI10.1007/S11856-023-2602-9zbMATH Open1546.05106MaRDI QIDQ6594751FDOQ6594751

Rajko Nenadov

Publication date: 28 August 2024

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-uniform hypergraphalmost-independent set

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• The probabilistic method
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• On sets of integers containing k elements in arithmetic progression
• Hypergraph containers
• Independent sets in hypergraphs
• The number of \(C_{2\ell}\)-free graphs
• Counting sum-free sets in abelian groups
• On \(K^ 4\)-free subgraphs of random graphs
• The number of the maximal triangle-free graphs
• On the KŁR conjecture in random graphs
• Threshold Functions for Ramsey Properties
• Simple Containers for Simple Hypergraphs
• Graph removal lemmas
• Counting independent sets in graphs
• Supersaturated Sparse Graphs and Hypergraphs
• The Number of Subsets of Integers with Nok-Term Arithmetic Progression
• THE METHOD OF HYPERGRAPH CONTAINERS
• A new proof of the KŁR conjecture
• On the number of points in general position in the plane
• An efficient container lemma
• A short nonalgorithmic proof of the containers theorem for hypergraphs

This page was built for publication: Probabilistic hypergraph containers

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