A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs

DOI10.20429/TAG.2018.050104MaRDI QIDQ5225543zbMATH OpenOpenAlexWikidataFDO

Authors Colton Magnant

Publication date 22 July 2019

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2018.050104

zbMATH Keywords

Gallai-Ramsey numbersnon-bipartite graphsrainbow triangle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
• Gallai-Ramsey numbers for graphs with chromatic number three
• Gallai-Ramsey number for \(K_4\)
• Gallai-Ramsey numbers for books
• Gallai-Ramsey numbers for cycles

Cited in

(3)

• Star-critical Gallai-Ramsey numbers of graphs
• Gallai–Ramsey number for K5 ${K}_{5}$
• Gallai-Ramsey number for complete graphs

This page was built for publication: A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs

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