Sharp thresholds for certain Ramsey properties of random graphs

DOI<1::AID-RSA1>3.0.CO;2-4 10.1002/1098-2418(200008)17:1<1::AID-RSA1>3.0.CO;2-4zbMath0953.05049OpenAlexW1988142136MaRDI QIDQ4500481

Michael Krivelevich, Ehud Friedgut

Publication date: 23 January 2001

Full work available at URL: https://doi.org/10.1002/1098-2418(200008)17:1<1::aid-rsa1>3.0.co;2-4

zbMATH Keywords

random graphsthresholdRamsey properties

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55)

Related Items

Towards the 0-statement of the Kohayakawa-Kreuter conjecture, Asymmetric Ramsey properties of random graphs involving cliques and cycles, SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS, An algorithmic framework for obtaining lower bounds for random Ramsey problems, Hunting for sharp thresholds, Regular pairs in sparse random graphs I, Ramsey properties of random discrete structures, Sharp thresholds for constraint satisfaction problems and homomorphisms, On Random Ordering Constraints, A sharp threshold for van der Waerden's theorem in random subsets, Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties, Coloring random graphs online without creating monochromatic subgraphs, An asymmetric random Rado theorem: 1-statement, Minimal ordered Ramsey graphs, A hierarchy of randomness for graphs, A sharp threshold for the renameable-Horn and the \(q\)-Horn properties, A randomized version of Ramsey's theorem

Cites Work

• Unnamed Item
• Supersaturated graphs and hypergraphs
• Ramsey properties of random graphs
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Threshold functions
• Ramsey properties of random hypergraphs
• Sharp thresholds of graph properties, and the $k$-sat problem
• Random graphs with monochromatic triangles in every edge coloring
• Threshold Functions for Ramsey Properties