arXiv Open Access 2020

Gallai-Ramsey number for the union of stars

Yaping Mao Zhao Wang Colton Magnant Ingo Sciermeyer

Lihat Sumber

Abstrak

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 the complete graph $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy of $G$. In this paper, we obtain the exact value of the Gallai-Ramsey numbers for the union of two stars in many cases and bounds in other cases. This work represents the first class of disconnected graphs to be considered as the desired monochromatic subgraph.

Topik & Kata Kunci

math.CO

Penulis (4)

Yaping Mao

Zhao Wang

Colton Magnant

Ingo Sciermeyer

Format Sitasi

APA MLA BibTeX

Mao, Y., Wang, Z., Magnant, C., Sciermeyer, I. (2020). Gallai-Ramsey number for the union of stars. https://arxiv.org/abs/2007.07240

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2020
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓