Combinatorial theorems in sparse random sets (Q350550): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964207251 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964207251 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q97694159 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.4310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial extensions of van der Waerden’s and Szemerédi’s theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of 3-uniform hypergraphs not containing a Fano plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theorems relative to a random set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the KŁR conjecture in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large triangle-free subgraphs in graphs without \(K_ 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds of graph properties, and the $k$-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold for random graphs with a monochromatic triangle in every edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey properties of random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Ramsey graphs for the four-cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triple Systems Not Containing a Fano Configuration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ergodic Szemerédi theorem for commuting transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small subsets inherit sparse \(\varepsilon\)-regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_4\)-free subgraphs of random graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: K<sub>5</sub>‐free subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Szemerédi's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions, approximate structure, transference, and the Hahn-Banach theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Schur properties of random subsets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The primes contain arbitrarily long arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán's extremal problem in random graphs: Forbidding even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán's extremal problem in random graphs: Forbidding odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for large deviations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper tails for subgraph counts in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The infamous upper tail / rank
 
Normal rank
Property / cites work
 
Property / cites work: The deletion method for upper tail estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number of the Fano plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi’s Regularity Lemma for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic progressions of length three in subsets of a random set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(K^ 4\)-free subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turn Theorem for Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey properties of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The counting lemma for regular <i>k</i>‐uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two-Point Configurations in a Random Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Combinatorial Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random graphs with monochromatic triangles in every edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Functions for Ramsey Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rado Partition Theorem for Random Subsets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey properties of random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability results for random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph containers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results for random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán's theorem in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the hypergraph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Positive Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Choice Number of Random Hypergraphs / rank
 
Normal rank

Latest revision as of 02:26, 13 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial theorems in sparse random sets
scientific article

    Statements

    Combinatorial theorems in sparse random sets (English)
    0 references
    0 references
    0 references
    7 December 2016
    0 references
    extremal combinatorics
    0 references
    random graphs
    0 references
    random sets
    0 references
    sparse analogues
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references