A short nonalgorithmic proof of the containers theorem for hypergraphs

DOI10.1090/proc/14368MaRDI QIDQ4621383

Anton Bernshteyn, Michelle Delcourt, Henry Towsner, Anush Tserunyan

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

05C35: Extremal problems in graph theory

05C65: Hypergraphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

03C20: Ultraproducts and related constructions