Gallai-Ramsey numbers for cycles

DOI10.1016/j.disc.2009.11.004zbMath1222.05186MaRDI QIDQ539886

Colton Magnant, Shinya Fujita

Publication date: 31 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.004

zbMATH Keywords

monochromatic cycles; Gallai-coloring; rainbow Ramsey

Mathematics Subject Classification ID

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

Related Items

A conjecture on Gallai-Ramsey numbers of even cycles and paths, Rainbow generalizations of Ramsey theory: A survey, Gallai-Ramsey numbers of \(C_7\) with multiple colors, Monochromatic subgraphs in the absence of a properly colored 4-cycle, Gallai-Ramsey numbers of odd cycles and complete bipartite graphs, Gallai-Ramsey numbers for monochromatic triangles or 4-cycles, Gallai-Ramsey numbers for books, Complete graphs and complete bipartite graphs without rainbow path, A decomposition of Gallai multigraphs, Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-colored complete graphs with precisely colored subgraphs
• Edge-colorings avoiding rainbow and monochromatic subgraphs
• All Ramsey numbers for cycles in graphs
• Ramsey numbers for cycles in graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• Extensions of Gallai-Ramsey results
• Ramsey-type results for Gallai colorings
• Edge colorings of complete graphs without tricolored triangles
• Transitiv orientierbare Graphen