A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
From MaRDI portal
Publication:3377334
DOI10.1090/memo/0845zbMath1087.05052arXivmath/0301200OpenAlexW2164025052WikidataQ106094339 ScholiaQ106094339MaRDI QIDQ3377334
Vojtěch Rödl, Ehud Friedgut, Andrzej Ruciński, Prasad Tetali
Publication date: 21 March 2006
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0301200
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (17)
Towards the 0-statement of the Kohayakawa-Kreuter conjecture ⋮ Upper tails for subgraph counts in random graphs ⋮ Combinatorial theorems in sparse random sets ⋮ SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS ⋮ The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ Hunting for sharp thresholds ⋮ Counting sum-free sets in abelian groups ⋮ Random sum-free subsets of abelian groups ⋮ Ramsey properties of random discrete structures ⋮ A sharp threshold for van der Waerden's theorem in random subsets ⋮ Large cycles in random generalized Johnson graphs ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties ⋮ An asymmetric random Rado theorem: 1-statement ⋮ The chromatic discrepancy of graphs ⋮ A randomized version of Ramsey's theorem
This page was built for publication: A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
