Gallai–Ramsey numbers for cycles |
| |
Authors: | Shinya Fujita Colton Magnant |
| |
Affiliation: | aGunma National College of Technology, 580 Toriba, Maebashi, Gunma, 371-8530, Japan;bLehigh University, 27 Memorial Dr, W. Bethlehem, PA, 18015, USA |
| |
Abstract: | For given graphs G and H and an integer k, the Gallai–Ramsey number is defined to be the minimum integer n such that, in any k coloring of the edges of Kn, there exists a subgraph isomorphic to either a rainbow coloring of G or a monochromatic coloring of H. In this work, we consider Gallai–Ramsey numbers for the case when G=K3 and H is a cycle of a fixed length. |
| |
Keywords: | Gallai-coloring Rainbow Ramsey Monochromatic cycles |
本文献已被 ScienceDirect 等数据库收录! |
|