Asymmetric Ramsey properties of random graphs involving cliques

DOI10.1002/rsa.20239zbMath1204.05059OpenAlexW4235659163MaRDI QIDQ3055757

Reto Spöhel, Martin Marciniszyn, Jozef Skokan, Angelika Steger

Publication date: 9 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20239

zbMATH Keywords

algorithmsrandom graphRamsey propertiesKLR-conjecture

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (13)

Towards the 0-statement of the Kohayakawa-Kreuter conjecture ⋮ Ramsey goodness of trees in random graphs ⋮ Asymmetric Ramsey properties of random graphs involving cliques and cycles ⋮ SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS ⋮ A Short Proof of the Random Ramsey Theorem ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Unnamed Item ⋮ Random Van der Waerden theorem ⋮ Ramsey properties of randomly perturbed graphs: cliques and cycles ⋮ Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties ⋮ An asymmetric random Rado theorem: 1-statement ⋮ Independent sets in hypergraphs ⋮ Upper bounds on probability thresholds for asymmetric Ramsey properties

Cites Work

• Unnamed Item
• Unnamed Item
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Regular pairs in sparse random graphs I
• A probabilistic counting lemma for complete graphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

This page was built for publication: Asymmetric Ramsey properties of random graphs involving cliques