Extremal results for random discrete structures

DOI10.4007/annals.2016.184.2.1zbMath1351.05207arXiv1603.00894WikidataQ97694035 ScholiaQ97694035MaRDI QIDQ350549

Publication date: 7 December 2016

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

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

zbMATH Keywords

thresholds; random graphs; Szemerédi's theorem; Turán's theorem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

60C05: Combinatorial probability

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

Related Items

Infinite Sidon Sets Contained in Sparse Random Sets of Integers, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, A short nonalgorithmic proof of the containers theorem for hypergraphs, Sum-Free Sets of Integers with a Forbidden Sum, The Maker--Breaker Rado Game on a Random Set of Integers, Relative Turán Problems for Uniform Hypergraphs, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, On Erdős–Ko–Rado for Random Hypergraphs II, An efficient container lemma, On Erdős–Ko–Rado for random hypergraphs I, Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers, Independent sets in hypergraphs, The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups, On the Number ofB_h-Sets, Simple Containers for Simple Hypergraphs, Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability, On two-point configurations in subsets of pseudo-random sets, Counting configuration-free sets in groups, Counting configuration-free sets in groups, Many $T$ copies in $H$-free graphs, The regularity method for graphs with few 4‐cycles, Probabilistic intuition holds for a class of small subgraph games, Diagonal Ramsey via effective quasirandomness, Lower tails via relative entropy, Polynomial configurations in subsets of random and pseudo-random sets, Online containers for hypergraphs, with applications to linear equations, Combinatorial theorems in sparse random sets, On the KŁR conjecture in random graphs, Extremal results for odd cycles in sparse pseudorandom graphs, On the number of monotone sequences, Hypergraph containers, The number of $K_{m,m}$-free graphs, Bandwidth theorem for random graphs, On the stability of the Erdős-Ko-Rado theorem, A probabilistic threshold for monochromatic arithmetic progressions, Upper tails for arithmetic progressions in random subsets, Supersaturation in posets and applications involving the container method, Counting sum-free sets in abelian groups, Random sum-free subsets of abelian groups, Covering graphs by monochromatic trees and Helly-type results for hypergraphs, Triangle-free subgraphs of hypergraphs, Independent sets in algebraic hypergraphs, Dirac-type theorems in random hypergraphs, Arcs in $\mathbb{F}_q^2$, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Integer colorings with no rainbow $k$-term arithmetic progression, Normal limiting distributions for systems of linear equations in random sets, A new proof of the KŁR conjecture, An analogue of the Erdős-Gallai theorem for random graphs, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, On the missing log in upper tail estimates, Bivariate fluctuations for the number of arithmetic progressions in random sets, Counting independent sets in graphs, A multi-dimensional Szemerédi theorem for the primes via a correspondence principle, A relative Szemerédi theorem, A note on sparse supersaturation and extremal results for linear homogeneous systems, Extremal results in sparse pseudorandom graphs, Triangle resilience of the square of a Hamilton cycle in random graphs, On zero-sum free sequences contained in random subsets of finite cyclic groups, Unnamed Item, The typical structure of sparse $K_{r+1}$-free graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Ramsey games near the critical threshold

Cites Work