On an anti‐Ramsey threshold for sparse graphs with one triangle

DOI10.1002/JGT.22150zbMath1380.05118OpenAlexW2615363413WikidataQ101496246 ScholiaQ101496246MaRDI QIDQ4604025

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

Publication date: 23 February 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22150

zbMATH Keywords

random graphsthresholdanti-Ramsey

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Density (toughness, etc.) (05C42)

Related Items (9)

Anti-Ramsey threshold of cycles for sparse graphs ⋮ Large Rainbow Cliques in Randomly Perturbed Dense Graphs ⋮ A new proof of the KŁR conjecture ⋮ On an anti-Ramsey threshold for random graphs ⋮ The anti-Ramsey threshold of complete graphs ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ Small rainbow cliques in randomly perturbed dense graphs ⋮ Anti-Ramsey threshold of cycles ⋮ Orientation Ramsey Thresholds for Cycles and Cliques

This page was built for publication: On an anti‐Ramsey threshold for sparse graphs with one triangle