English

A note on Gallai-Ramsey number of even wheels

Combinatorics 2019-10-29 v2

Abstract

A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai kk-coloring is a Gallai coloring that uses kk colors. Given a graph HH and an integer k1k\geq 1, the Gallai-Ramsey number GRk(H)GR_k(H) of HH is the least positive integer NN such that every Gallai kk-coloring of the complete graph KNK_N contains a monochromatic copy of HH. Let W2nW_{2n} denote an even wheel on 2n+152n+1\ge5 vertices. In this note, we study Gallai-Ramsey number of W2nW_{2n} and completely determine the exact value of GRk(W4)GR_k(W_4) for all k2k\ge2.

Keywords

Cite

@article{arxiv.1905.13564,
  title  = {A note on Gallai-Ramsey number of even wheels},
  author = {Zi-Xia Song and Bing Wei and Fangfang Zhang and Qinghong Zhao},
  journal= {arXiv preprint arXiv:1905.13564},
  year   = {2019}
}

Comments

This note was submitted to Discrete Mathematics for publication on January 28, 2019. arXiv admin note: text overlap with arXiv:1809.00227, arXiv:1808.09963, arXiv:1808.10282, arXiv:1803.07963