An efficient container lemma (Q5144433): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
label / enlabel / en
 
An efficient container lemma
Property / DOI
 
Property / DOI: 10.19086/da.17354 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3113357224 / rank
 
Normal rank
Property / arXiv classification
 
math.CO
Property / arXiv classification: math.CO / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1910.09208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-linear lower bound for planar epsilon-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typical structure of graphs without given excluded subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typical structure of graphs with no large cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typical structure of sparse $K_{r+1}$-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of points in general position in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short nonalgorithmic proof of the containers theorem for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of graphs with large forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Induced Ramsey Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two problems in graph Ramsey theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theorems in sparse random sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4056030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density theorems for bipartite graphs and related Ramsey-type results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey properties of random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A density version of the Hales-Jewett theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Relations and Chromatic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for large deviations / rank
 
Normal rank
Property / cites work
 
Property / cites work: K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost tight bounds for \(\epsilon\)-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(C_{2\ell}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Graphs Without Large Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Random Ramsey Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey property for graphs with forbidden complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for the size of epsilon-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random I‐colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential-type upper bound for Folkman numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey properties of random graphs and folkman numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph containers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Containers for Simple Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results for random discrete structures / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.19086/DA.17354 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:06, 30 December 2024

scientific article; zbMATH DE number 7297304
Language Label Description Also known as
English
An efficient container lemma
scientific article; zbMATH DE number 7297304

    Statements

    0 references
    0 references
    16 January 2021
    0 references
    hypergraph container theorems
    0 references
    high-dimensional convex geometry
    0 references
    math.CO
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers