Ramsey properties of random discrete structures
From MaRDI portal
Publication:3061178
DOI10.1002/rsa.20352zbMath1228.05284OpenAlexW4248180758WikidataQ97694969 ScholiaQ97694969MaRDI QIDQ3061178
Mathias Schacht, Vojtěch Rödl, Ehud Friedgut
Publication date: 14 December 2010
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20352
Related Items (33)
Ramsey properties of random graphs and folkman numbers ⋮ Extremal results for random discrete structures ⋮ Combinatorial theorems in sparse random sets ⋮ A note on sparse supersaturation and extremal results for linear homogeneous systems ⋮ Upper tails for arithmetic progressions in random subsets ⋮ On the stability of the Erdős-Ko-Rado theorem ⋮ A probabilistic threshold for monochromatic arithmetic progressions ⋮ On an anti-Ramsey threshold for random graphs ⋮ An asymmetric random Rado theorem for single equations: The 0‐statement ⋮ Ramsey goodness of trees in random graphs ⋮ SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS ⋮ The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups ⋮ A Short Proof of the Random Ramsey Theorem ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Extremal results in sparse pseudorandom graphs ⋮ On the KŁR conjecture in random graphs ⋮ Turánnical hypergraphs ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ An exponential-type upper bound for Folkman numbers ⋮ Counting configuration-free sets in groups ⋮ Random sum-free subsets of abelian groups ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ An efficient container lemma ⋮ Triangle-free subgraphs of hypergraphs ⋮ A sharp threshold for van der Waerden's theorem in random subsets ⋮ On an anti-Ramsey property of random graphs ⋮ Ramsey properties of randomly perturbed graphs: cliques and cycles ⋮ Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers ⋮ An asymmetric random Rado theorem: 1-statement ⋮ Independent sets in hypergraphs ⋮ Upper bounds on probability thresholds for asymmetric Ramsey properties ⋮ A randomized version of Ramsey's theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Balanced online Ramsey games in random graphs
- Quantitative theorems for regular systems of equations
- On Schur properties of random subsets of integers
- Ramsey properties of random hypergraphs
- Ramsey's theorem for a class of categories
- Offline thresholds for Ramsey-type games on random graphs
- A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
- Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
- Upper Bounds for Online Ramsey Games in Random Graphs
- Online Ramsey Games in Random Graphs
- Regularity and Positional Games
- Poisson approximation for large deviations
- Random graphs with monochromatic triangles in every edge coloring
- Rado Partition Theorem for Random Subsets of Integers
- Sharp thresholds for certain Ramsey properties of random graphs
- Extremal problems on set systems
- Ramsey Games Against a One-Armed Bandit
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Ramsey properties of random discrete structures
