Extremal results for random discrete structures
From MaRDI portal
Abstract: We study thresholds for extremal properties of random discrete structures. We determine the threshold for Szemer'edi's theorem on arithmetic progressions in random subsets of the integers and its multidimensional extensions and we determine the threshold for Tur'an-type problems for random graphs and hypergraphs. In particular, we verify a conjecture of Kohayakawa, L uczak, and R"odl for Tur'an-type problems in random graphs. Similar results were obtained by Conlon and Gowers.
Recommendations
Cites work
- scientific article; zbMATH DE number 5830771 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3031694 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- An ergodic Szemerédi theorem for commuting transformations
- An extremal problem for random graphs and the number of graphs with large even-girth
- Arithmetic progressions of length three in subsets of a random set
- Combinatorial theorems in sparse random sets
- Extremal subgraphs of random graphs
- Graph theory
- Graph theory
- K5‐free subgraphs of random graphs
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- On Schur properties of random subsets of integers
- On Some Sequences of Integers
- On \(K^ 4\)-free subgraphs of random graphs
- On a problem of K. Zarankiewicz
- On extremal problems of graphs and generalized graphs
- On sets of integers containing k elements in arithmetic progression
- On the structure of linear graphs
- Quantitative theorems for regular systems of equations
- Rado Partition Theorem for Random Subsets of Integers
- Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
- Ramsey properties of random discrete structures
- Random Ramsey graphs for the four-cycle
- Random graphs.
- Studien zur Kombinatorik
- Supersaturated graphs and hypergraphs
- The Turn Theorem for Random Graphs
- Threshold Functions for Ramsey Properties
- Turán's extremal problem in random graphs: Forbidding even cycles
- Turán's extremal problem in random graphs: Forbidding odd cycles
- Turán's theorem in sparse random graphs
Cited in
(87)- On the stability of the Erdős-Ko-Rado theorem
- Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
- Threshold progressions in covering and packing contexts
- A note on sparse supersaturation and extremal results for linear homogeneous systems
- Arcs in \(\mathbb{F}_q^2\)
- On the number of monotone sequences
- On the number of \(B_h\)-sets
- Stability results for random discrete structures
- Polynomial configurations in subsets of random and pseudo-random sets
- Counting sum-free sets in abelian groups
- Counting independent sets in graphs
- Integer colorings with no rainbow \(k\)-term arithmetic progression
- Random combinatorial structures: the convergent case
- On the missing log in upper tail estimates
- Ramsey properties of random discrete structures
- A probabilistic threshold for monochromatic arithmetic progressions
- On the KŁR conjecture in random graphs
- Counting configuration-free sets in groups
- Sampling hierarchies of discrete random structures
- Independent sets in algebraic hypergraphs
- On zero-sum free sequences contained in random subsets of finite cyclic groups
- Simple containers for simple hypergraphs
- Many \(T\) copies in \(H\)-free graphs
- Bandwidth theorem for random graphs
- The typical structure of sparse \(K_{r+1}\)-free graphs
- Triangle-free subgraphs of hypergraphs
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Independent sets in hypergraphs
- Diagonal Ramsey via effective quasirandomness
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Normal limiting distributions for systems of linear equations in random sets
- Infinite Sidon sets contained in sparse random sets of integers
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Ramsey games near the critical threshold
- Supersaturation in posets and applications involving the container method
- Extremal results in sparse pseudorandom graphs
- On Erdős-Ko-Rado for random hypergraphs. II
- On Erdős-Ko-Rado for random hypergraphs. I
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- On two-point configurations in subsets of pseudo-random sets
- The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
- An efficient container lemma
- Upper tails for arithmetic progressions in random subsets
- The number of \(K_{m,m}\)-free graphs
- Combinatorial theorems in sparse random sets
- Covering random graphs with monochromatic trees
- A relative Szemerédi theorem
- A short nonalgorithmic proof of the containers theorem for hypergraphs
- A randomized version of Ramsey's theorem
- Largest subgraph from a hereditary property in a random graph
- Random sum-free subsets of abelian groups
- Deviation probabilities for arithmetic progressions and other regular discrete structures
- Online containers for hypergraphs, with applications to linear equations
- Relative Turán problems for uniform hypergraphs
- Hypergraph containers
- The Maker-Breaker Rado game on a random set of integers
- Extremal results for odd cycles in sparse pseudorandom graphs
- Hypergraph removal lemmas via robust sharp threshold theorems
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- Dirac-type theorems in random hypergraphs
- A new proof of the KŁR conjecture
- An analogue of the Erdős-Gallai theorem for random graphs
- Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
- The power of many colours
- Deviation probabilities for arithmetic progressions and other regular discrete structures
- On Szemerédi's theorem with differences from a random set
- Weakly saturated random graphs
- Triangle resilience of the square of a Hamilton cycle in random graphs
- On the maximum \(F_5\)-free subhypergraphs of a random hypergraph
- Turán theorems for even cycles in random hypergraph
- Sum-free sets of integers with a forbidden sum
- Random polynomial graphs for random Turán problems
- The regularity method for graphs with few 4‐cycles
- Lower tails via relative entropy
- scientific article; zbMATH DE number 1948235 (Why is no real title available?)
- Upper bounds for the number of substructures in finite geometries from the container method
- Probabilistic hypergraph containers
- Counting configuration-free sets in groups
- Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs
- Turán‐type problems for long cycles in random and pseudo‐random graphs
- On the threshold for Szemerédi's theorem with random differences
- Interview with David Conlon
- Ramsey goodness of trees in random graphs
- Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers
- Probabilistic intuition holds for a class of small subgraph games
This page was built for publication: Extremal results for random discrete structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350549)
