On the multi-colored Ramsey numbers of cycles

DOI10.1002/jgt.20572zbMath1242.05174arXiv1005.3926MaRDI QIDQ3113287

Jozef Skokan, Tomasz Łuczak, Miklós Simmonovits

Publication date: 8 February 2012

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

Full work available at URL: https://arxiv.org/abs/1005.3926

zbMATH Keywords

edge-coloring; color class

Mathematics Subject Classification ID

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

Related Items

The multicolour Ramsey number of a long odd cycle, On globally sparse Ramsey graphs, Improved bounds on the multicolor Ramsey numbers of paths and even cycles, On the multi-colored Ramsey numbers of paths and even cycles, Gallai-Ramsey numbers of odd cycles and complete bipartite graphs, Exact Ramsey numbers of odd cycles via nonlinear optimisation, Long monochromatic paths and cycles in 2-edge-colored multipartite graphs, Multicolour Ramsey numbers of paths and even cycles

Cites Work

• The 3-colored Ramsey number of even cycles
• All Ramsey numbers for cycles in graphs
• Constructive lower bounds on classical multicolor Ramsey numbers
• New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
• Multi-color Ramsey numbers of even cycles
• Ramsey numbers for cycles in graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
• On maximal paths and circuits of graphs
• The multi-color Ramsey number of an odd cycle
• A problem of Schur and its generalizations
• Unnamed Item
• Unnamed Item