Anti-Ramsey properties of random graphs

DOI10.1016/j.jctb.2009.09.002zbMath1216.05139OpenAlexW2015373594WikidataQ57401458 ScholiaQ57401458MaRDI QIDQ965256

Cliff Smyth, Oleg Pikhurko, Tom Bohman, Alan M. Frieze

Publication date: 21 April 2010

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2009.09.002

zbMATH Keywords

random graphsRamsey theory

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (5)

Large Rainbow Cliques in Randomly Perturbed Dense Graphs ⋮ On an anti-Ramsey threshold for random graphs ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ Small rainbow cliques in randomly perturbed dense graphs ⋮ On an anti-Ramsey property of random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polychromatic Hamilton cycles
• An anti-Ramsey condition on trees
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• More star sub-Ramsey numbers
• A note on local colorings of graphs
• Multicoloured Hamilton cycles
• Multicolored subsets in colored hypergraphs
• Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs
• Paths in graphs
• Threshold Functions for Ramsey Properties

This page was built for publication: Anti-Ramsey properties of random graphs