Stability results for random discrete structures

DOI10.1002/rsa.20477zbMath1290.05131arXiv1111.6885OpenAlexW2087686829MaRDI QIDQ5415592

Wojciech Samotij

Publication date: 13 May 2014

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.6885

zbMATH Keywords

random graphsextremal problemsrandom setsTurán's theoremErdős-Simonovits stability theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (20)

Mantel's theorem for random graphs ⋮ A new proof of the KŁR conjecture ⋮ Combinatorial theorems in sparse random sets ⋮ Upper tails for arithmetic progressions in random subsets ⋮ Ramsey goodness of trees in random graphs ⋮ A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs ⋮ On the maximum \(F_5\)-free subhypergraphs of a random hypergraph ⋮ The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Hypergraph containers ⋮ On \(k\)-uniform random hypergraphs without generalized fans ⋮ Mantel's theorem for random hypergraphs ⋮ Random sum-free subsets of abelian groups ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Independent sets in hypergraphs ⋮ Counting independent sets in graphs ⋮ Exact stability for Turán’s Theorem

Cites Work

• Unnamed Item
• Combinatorial theorems in sparse random sets
• Supersaturated graphs and hypergraphs
• A variant of the hypergraph removal lemma
• An exact Turán result for the generalized triangle
• Quadruple systems with independent neighborhoods
• On \(K^ 4\)-free subgraphs of random graphs
• Stability theorems for cancellative hypergraphs
• Turán's extremal problem in random graphs: Forbidding even cycles
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• Counting sum-free sets in abelian groups
• Random sum-free subsets of abelian groups
• The Turán number of the Fano plane
• On a hypergraph Turán problem of Frankl
• Sum-free sets in abelian groups
• 4-books of three pages
• A Szemerédi-type regularity lemma in abelian groups, with applications
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Threshold Functions for Ramsey Properties
• The counting lemma for regular k‐uniform hypergraphs
• Maximal sum-free sets of elements of finite groups
• Triple Systems Not Containing a Fano Configuration
• On Triple Systems with Independent Neighbourhoods
• On the structure of linear graphs

This page was built for publication: Stability results for random discrete structures