Gallai-Ramsey number for complete graphs

DOI10.1007/978-3-030-83823-2_28MaRDI QIDQ6604691

Ingo Schiermeyer, Colton Magnant

Publication date: 13 September 2024

zbMATH Keywords

Ramsey numbersGallai coloringGallai-Ramsey numbersFox-Grinshpun-Pach conjectureMcKay-Radziszowski conjecture

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites Work

• Edge-colored complete graphs with precisely colored subgraphs
• Subgraph counting identities and Ramsey numbers
• The Erdős-Hajnal conjecture for rainbow triangles
• Ramsey-type results for Gallai colorings
• R(4, 5) = 25
• Gallai‐Ramsey number for K4
• A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
• Transitiv orientierbare Graphen
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: Gallai-Ramsey number for complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604691)