An efficient container lemma
From MaRDI portal
Abstract: We prove a new, efficient version of the hypergraph container theorems that is suited for hypergraphs with large uniformities. The main novelty is a refined approach to constructing containers that employs simple ideas from high-dimensional convex geometry. The existence of smaller families of containers for independent sets in such hypergraphs, which is guaranteed by the new theorem, allows us to improve upon the best currently known bounds for several problems in extremal graph theory, discrete geometry, and Ramsey theory.
Recommendations
Cites work
- -nets and simplex range queries
- A density version of the Hales-Jewett theorem
- A non-linear lower bound for planar epsilon-nets
- A note on induced Ramsey numbers
- A short nonalgorithmic proof of the containers theorem for hypergraphs
- A short proof of the random Ramsey theorem
- Almost tight bounds for -nets
- An exponential-type upper bound for Folkman numbers
- Combinatorial Relations and Chromatic Graphs
- Combinatorial theorems in sparse random sets
- Density theorems for bipartite graphs and related Ramsey-type results
- Extremal results for random discrete structures
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- scientific article; zbMATH DE number 3869331 (Why is no real title available?)
- scientific article; zbMATH DE number 3470438 (Why is no real title available?)
- scientific article; zbMATH DE number 3487493 (Why is no real title available?)
- scientific article; zbMATH DE number 3557819 (Why is no real title available?)
- scientific article; zbMATH DE number 3893206 (Why is no real title available?)
- Hypergraph containers
- Independent sets in hypergraphs
- K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
- On the number of graphs without large cliques
- On the number of points in general position in the plane
- On two problems in graph Ramsey theory
- Poisson approximation for large deviations
- Ramsey properties of random discrete structures
- Ramsey properties of random graphs and folkman numbers
- Random I‐colorable graphs
- Simple containers for simple hypergraphs
- Small-size -nets for axis-parallel rectangles and boxes
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The number of \(C_{2\ell}\)-free graphs
- The number of graphs with large forbidden subgraphs
- The probabilistic method
- The Ramsey property for graphs with forbidden complete subgraphs
- The typical structure of graphs with no large cliques
- The typical structure of graphs without given excluded subgraphs
- The typical structure of sparse \(K_{r+1}\)-free graphs
- Tight lower bounds for the size of epsilon-nets
Cited in
(14)- A new lower bound on Hadwiger-Debrunner numbers in the plane
- Two problems in graph Ramsey theory
- Online containers for hypergraphs, with applications to linear equations
- A short nonalgorithmic proof of the containers theorem for hypergraphs
- Large cliques and independent sets all over the place
- The method of hypergraph containers
- Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers
- List Ramsey numbers
- Lower tails via relative entropy
- The Typical Approximate Structure of Sets with Bounded Sumset
- Probabilistic hypergraph containers
- On the typical structure of graphs not containing a fixed vertex-critical subgraph
- Sharp thresholds for Ramsey properties
- Short proof of the hypergraph container theorem
This page was built for publication: An efficient container lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144433)
