An efficient container lemma
From MaRDI portal
Publication:5144433
DOI10.19086/da.17354zbMath1475.05124arXiv1910.09208OpenAlexW3113357224MaRDI QIDQ5144433
József Balogh, Wojciech Samotij
Publication date: 16 January 2021
Published in: discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.09208
Related Items (5)
Two problems in graph Ramsey theory ⋮ List Ramsey numbers ⋮ Lower tails via relative entropy ⋮ A new lower bound on Hadwiger-Debrunner numbers in the plane ⋮ Large cliques and independent sets all over the place
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of \(C_{2\ell}\)-free graphs
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- On two problems in graph Ramsey theory
- Hypergraph containers
- A non-linear lower bound for planar epsilon-nets
- The typical structure of graphs with no large cliques
- An exponential-type upper bound for Folkman numbers
- The number of graphs with large forbidden subgraphs
- Density theorems for bipartite graphs and related Ramsey-type results
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- \(\epsilon\)-nets and simplex range queries
- Almost tight bounds for \(\epsilon\)-nets
- The Ramsey property for graphs with forbidden complete subgraphs
- A density version of the Hales-Jewett theorem
- Ramsey properties of random graphs and folkman numbers
- The typical structure of sparse $K_{r+1}$-free graphs
- Ramsey properties of random discrete structures
- The typical structure of graphs without given excluded subgraphs
- K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
- Poisson approximation for large deviations
- Random I‐colorable graphs
- A Note on Induced Ramsey Numbers
- A short nonalgorithmic proof of the containers theorem for hypergraphs
- On the number of points in general position in the plane
- Tight lower bounds for the size of epsilon-nets
- On the Number of Graphs Without Large Cliques
- Independent sets in hypergraphs
- A Short Proof of the Random Ramsey Theorem
- Simple Containers for Simple Hypergraphs
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- Combinatorial Relations and Chromatic Graphs
This page was built for publication: An efficient container lemma
