Extremal results for random discrete structures

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

Mathias Schacht

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

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (71)

Independent sets in algebraic hypergraphs ⋮ Polynomial configurations in subsets of random and pseudo-random sets ⋮ 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 ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ Normal limiting distributions for systems of linear equations in random sets ⋮ A new proof of the KŁR conjecture ⋮ Combinatorial theorems in sparse random sets ⋮ A note on sparse supersaturation and extremal results for linear homogeneous systems ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ Upper tails for arithmetic progressions in random subsets ⋮ Supersaturation in posets and applications involving the container method ⋮ On the stability of the Erdős-Ko-Rado theorem ⋮ A probabilistic threshold for monochromatic arithmetic progressions ⋮ Diagonal Ramsey via effective quasirandomness ⋮ Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers] ⋮ Covering random graphs with monochromatic trees ⋮ Ramsey goodness of trees in random graphs ⋮ Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs ⋮ Largest subgraph from a hereditary property in a random graph ⋮ Lower tails via relative entropy ⋮ On the maximum $F_5$-free subhypergraphs of a random hypergraph ⋮ Random polynomial graphs for random Turán problems ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ On zero-sum free sequences contained in random subsets of finite cyclic groups ⋮ Infinite Sidon Sets Contained in Sparse Random Sets of Integers ⋮ 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 ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Counting configuration-free sets in groups ⋮ Extremal results in sparse pseudorandom graphs ⋮ A short nonalgorithmic proof of the containers theorem for hypergraphs ⋮ The number of $K_{m,m}$-free graphs ⋮ Sum-Free Sets of Integers with a Forbidden Sum ⋮ On the KŁR conjecture in random graphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Extremal results for odd cycles in sparse pseudorandom graphs ⋮ On the number of monotone sequences ⋮ Hypergraph containers ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ Counting configuration-free sets in groups ⋮ On two-point configurations in subsets of pseudo-random sets ⋮ Unnamed Item ⋮ Counting sum-free sets in abelian groups ⋮ Random sum-free subsets of abelian groups ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ On the missing log in upper tail estimates ⋮ Bivariate fluctuations for the number of arithmetic progressions in random sets ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Many $T$ copies in $H$-free graphs ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs ⋮ On Erdős–Ko–Rado for Random Hypergraphs II ⋮ An efficient container lemma ⋮ Triangle-free subgraphs of hypergraphs ⋮ Ramsey games near the critical threshold ⋮ On Erdős–Ko–Rado for random hypergraphs I ⋮ Bandwidth theorem for random graphs ⋮ Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers ⋮ Independent sets in hypergraphs ⋮ Counting independent sets in graphs ⋮ A multi-dimensional Szemerédi theorem for the primes via a correspondence principle ⋮ The regularity method for graphs with few 4‐cycles ⋮ A relative Szemerédi theorem ⋮ Probabilistic intuition holds for a class of small subgraph games

Cites Work

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