Ramsey and Gallai-Ramsey Number for Wheels

Given a graph G and a positive integer k , define the 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 . Much like graph Ramsey numbers, Gallai-Ramsey numbers have...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2022-04, Vol.38 (2), Article 42
Hauptverfasser:	Mao, Yaping, Wang, Zhao, Magnant, Colton, Schiermeyer, Ingo
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Combinatorics Engineering Design Graph coloring Graph theory Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!