Gallai-Ramsey numbers for fans

DOI10.1016/J.DISC.2023.113338arXiv1902.10706MaRDI QIDQ6314747FDOQ6314747

Authors: Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer 

Publication date: 27 February 2019

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 $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy of $G$. In this paper, we obtain general upper and lower bounds on the Gallai-Ramsey numbers for fans $F_m=K_1+m{K}_2$ and prove the sharp result for $m=2$ and for $m=3$ with $k$ even.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

This page was built for publication: Gallai-Ramsey numbers for fans

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