Ramsey and Gallai-Ramsey number for wheels

From MaRDI portal
Publication:2115156

DOI10.1007/S00373-021-02406-6zbMATH Open1485.05110arXiv1905.12414OpenAlexW4210737048MaRDI QIDQ2115156FDOQ2115156


Authors: Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer Edit this on Wikidata


Publication date: 15 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: Given a graph G and a positive integer k, define the emph{Gallai-Ramsey number} to be the minimum number of vertices n such that any k-edge coloring of Kn contains either a rainbow (all different colored) triangle or a monochromatic copy of G. Much like graph Ramsey numbers, Gallai-Ramsey numbers have gained a reputation as being very difficult to compute in general. As yet, still only precious few sharp results are known. In this paper, we obtain bounds on the Gallai-Ramsey number for wheels and the exact value for the wheel on 5 vertices.


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




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Ramsey and Gallai-Ramsey number for wheels

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