A short nonalgorithmic proof of the containers theorem for hypergraphs

DOI10.1090/proc/14368OpenAlexW2964038337WikidataQ129241753 ScholiaQ129241753MaRDI QIDQ4621383

Michelle Delcourt, Anush Tserunyan, Anton Bernshteyn, Henry Towsner

Publication date: 12 February 2019

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ultraproducts and related constructions (03C20)

Related Items (3)

Independent sets in algebraic hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ An efficient container lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• On pseudo-finite dimensions
• Hypergraph containers
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Nonstandard methods in Ramsey theory and combinatorial number theory
• Stable group theory and approximate subgroups
• On sets of integers containing k elements in arithmetic progression
• On triangle-free random graphs
• Combinatorial theorems relative to a random set
• THE METHOD OF HYPERGRAPH CONTAINERS
• Independent sets in hypergraphs
• Simple Containers for Simple Hypergraphs
• Extremal Results in Random Graphs

This page was built for publication: A short nonalgorithmic proof of the containers theorem for hypergraphs