Extremal problems and results related to Gallai-colorings

Xihe Li, Hajo Broersma*, Ligong Wang

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

14 Downloads (Pure)


A Gallai-coloring (Gallai-k-coloring) is an edge-coloring (with colors from {1,2,…,k}) of a complete graph without rainbow triangles. Given a graph H and a positive integer k, the k-colored Gallai-Ramsey number GRk(H) is the minimum integer n such that every Gallai-k-coloring of the complete graph Kn contains a monochromatic copy of H. In this paper, we consider two extremal problems related to Gallai-k-colorings. First, we determine upper and lower bounds for the maximum number of edges that are not contained in any rainbow triangle or monochromatic triangle in a k-edge-coloring of Kn. Second, for n≥GRk(K3), we determine upper and lower bounds for the minimum number of monochromatic triangles in a Gallai-k-coloring of Kn, yielding the exact value for k=3. Furthermore, we determine the Gallai-Ramsey number GRk(K4+e) for the graph on five vertices consisting of a K4 with a pendant edge.

Original languageEnglish
Article number112567
JournalDiscrete mathematics
Issue number11
Publication statusPublished - Nov 2021


  • Gallai-Ramsey theory
  • Monochromatic copy of a graph
  • Rainbow triangle
  • Ramsey multiplicity
  • Regularity lemma
  • UT-Hybrid-D


Dive into the research topics of 'Extremal problems and results related to Gallai-colorings'. Together they form a unique fingerprint.

Cite this