THE METHOD OF HYPERGRAPH CONTAINERS

DOI10.1142/9789813272880_0172zbMath1448.05147arXiv1801.04584OpenAlexW2972608511MaRDI QIDQ5122147

József Balogh, Robert Morris, Wojciech Samotij

Publication date: 22 September 2020

Published in: Proceedings of the International Congress of Mathematicians (ICM 2018) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.04584

zbMATH Keywords

Ramsey theoryextremal graph theoryfinite objects with forbidden substructures

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (15)

Independent sets in algebraic hypergraphs ⋮ On the smallest singular value of symmetric random matrices ⋮ Multicolor chain avoidance in the Boolean lattice ⋮ On the number of sets with a given doubling constant ⋮ Extremal problems in hypergraph colourings ⋮ On an extremal problem for locally sparse multigraphs ⋮ Counting numerical semigroups by Frobenius number, multiplicity, and depth ⋮ A short nonalgorithmic proof of the containers theorem for hypergraphs ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ Groups with few maximal sum-free sets ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ On the singularity of random symmetric matrices ⋮ Triangle-free subgraphs of hypergraphs ⋮ Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties ⋮ On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion

This page was built for publication: THE METHOD OF HYPERGRAPH CONTAINERS