Simple Containers for Simple Hypergraphs

David Saxton, Andrew Thomason

Type: Article

Publication Date: 2015-08-17

Citations: 14

DOI: https://doi.org/10.1017/s096354831500022x

Abstract

We give an easy method for constructing containers for simple hypergraphs. The method also has consequences for non-simple hypergraphs. Some applications are given; in particular, a very transparent calculation is offered for the number of H -free hypergraphs, where H is some fixed uniform hypergraph.

Locations

arXiv (Cornell University) - View - PDF
Apollo (University of Cambridge) - View - PDF
DataCite API - View
Combinatorics Probability Computing - View

Similar Works

Action	Title	Year	Authors
+	Some Particular Hypergraphs	2013	Alain Bretto
+	Hypergraphs	1995	Pierre Duchet
+	Hypergraphs	2015	Alan Frieze Michał Karoński
+	Extremal problems for colorings of simple hypergraphs and applications	2015	Jakub Kozik D. A. Shabanov
+	A short nonalgorithmic proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan
+	Counting Hypergraphs with Large Girth	2020	Sam Spiro Jacques Verstraëte
+	Colorings of b-simple hypergraphs	2017	Margarita Akhmejanova D. A. Shabanov
+ PDF Chat	Simple hypergraphs with maximal number of adjacent pairs of edges	1980	Rudolf Ahlswede
+	Around Erdős–Lovász problem on colorings of non-uniform hypergraphs	2015	D. A. Shabanov
+ PDF Chat	On some building blocks of hypergraphs	2024	Anirban Banerjee Samiron Parui
+	The Uniformity Lemma for hypergraphs	1992	Péter Frankl V. Rödl
+	Coloring hypergraphs with bounded cardinalities of edge intersections	2019	Margarita Akhmejanova D. A. Shabanov
+	Triangle-free Subgraphs of Hypergraphs	2020	Jiaxi Nie Sam Spiro Jacques Verstraëte
+	On the number of linear hypergraphs of large girth	2017	József Balogh Lina Li
+	A Dirac-Type Theorem for Uniform Hypergraphs	2024	Yue Ma Xinmin Hou Jun Gao
+ PDF Chat	Hypergraph containers	2015	David Saxton Andrew Thomason
+	Sparse hypergraphs: From theory to applications	2022	Shangguan Chong Gennian Ge
+	A short nonalgorithmic proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan
+	A short nonalgorithmic proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan
+ PDF Chat	Short proof of the hypergraph container theorem	2024	Rajko Nenadov Huy Tuan Pham

Works That Cite This (14)

Action	Title	Year	Authors
+ PDF Chat	On the structure of oriented graphs and digraphs with forbidden tournaments or cycles	2017	Daniela Kühn Deryk Osthus Timothy Townsend Yi Zhao
+	Online containers for hypergraphs, with applications to linear equations	2016	David Saxton Andrew Thomason
+	A short nonalgorithmic proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan
+	An efficient container lemma	2019	József Balogh Wojciech Samotij
+	Multicolour containers and the entropy of decorated graph limits	2016	Victor Falgas–Ravry Kelly O'Connell Johanna Strömberg Andrew J. Uzzell
+ PDF Chat	Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers	2023	Victor Falgas–Ravry Robert Hancock Johanna Strömberg Andrew J. Uzzell
+	On the structure of oriented graphs and digraphs with forbidden tournaments or cycles	2014	Deryk Osthus Daniela Kühn Timothy Townsend Yi Zhao
+ PDF Chat	None	2020	József Balogh Wojciech Samotij
+ PDF Chat	Hypergraph containers	2015	David Saxton Andrew Thomason
+	A short nonalgorithmic proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan

Works Cited by This (15)

Action	Title	Year	Authors
+	Extremal Hypergraph Problems and the Regularity Method	2007	Brendan Nagle Vojtěch Rödl Mathias Schacht
+ PDF Chat	Hereditary properties of hypergraphs	2008	R. Dotson Brendan Nagle
+	The structure of hereditary properties and 2-coloured multigraphs	2011	Edward Marchant Andrew Thomason
+	Turán's theorem in sparse random graphs	2003	Tibor Szabó Van H. Vu
+	The Structure of Hereditary Properties and Colourings of Random Graphs	2000	Béla Bollobás Andrew Thomason
+	Independent sets in hypergraphs	2014	József Balogh Robert Morris Wojciech Samotij
+	List Colourings of Regular Hypergraphs	2012	David Saxton Andrew Thomason
+	OnK 4-free subgraphs of random graphs	1997	Yoshiharu Kohayakawa Tomasz Łuczak V. Rödl
+	The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent	1986	Péter L. Erdős Péter Frankl V. Rödl
+ PDF Chat	Supersaturated graphs and hypergraphs	1983	Paul Erdős Miklós Simonovits