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 -coloring is a Gallai coloring that uses colors. Given a graph and an integer , the Gallai-Ramsey number of is the least positive integer such that every Gallai -coloring of the complete graph contains a monochromatic copy of . Let denote an even wheel on vertices. In this note, we study Gallai-Ramsey number of and completely determine the exact value of for all .
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