Anti-Ramsey threshold of cycles for sparse graphs

DOI10.1016/J.ENTCS.2019.08.009OpenAlexW2977660455WikidataQ113317424 ScholiaQ113317424MaRDI QIDQ2132335

Gabriel F. Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota, Olaf Parczyk

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.009

zbMATH Keywords

random graphsthresholdanti-Ramseyproper colouring

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (1)

Large Rainbow Cliques in Randomly Perturbed Dense Graphs

Cites Work

• On an anti-Ramsey threshold for random graphs
• Threshold functions
• An algorithmic framework for obtaining lower bounds for random Ramsey problems
• Rainbow subgraphs in properly edge‐colored graphs
• On an anti‐Ramsey threshold for sparse graphs with one triangle
• Threshold Functions for Ramsey Properties
• Unnamed Item
• Unnamed Item

This page was built for publication: Anti-Ramsey threshold of cycles for sparse graphs