On an anti-Ramsey property of random graphs

DOI10.1016/j.endm.2011.05.041zbMath1268.05181OpenAlexW2044105263MaRDI QIDQ2840714

P. B. Konstadinidis, Yoshiharu Kohayakawa, Guilherme Oliveira Mota

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.041

zbMATH Keywords

random graphsregularity lemmarainbow colouringsmulticoloured subgraphsanti-Ramsey properties

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anti-Ramsey properties of random graphs
• Threshold functions
• On \(K^ 4\)-free subgraphs of random graphs
• Sparse quasi-random graphs
• Ramsey properties of random discrete structures
• Rainbow subgraphs in properly edge‐colored graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Regular pairs in sparse random graphs I
• The Turn Theorem for Random Graphs
• Threshold Functions for Ramsey Properties