Gallai-Ramsey numbers for monochromatic K₄^{+} or K_{3}

Abstract: A Gallai

k

-coloring is a

k

-edge coloring of a complete graph in which there are no rainbow triangles. For two given graphs

H, G

and two positive integers

k, s

with that

s l e q k

, the

k

-colored Gallai-Ramsey number

g r_{k} (K_{3} : s c d o t H, (k - s) c d o t G)

is the minimum integer

n

such that every Gallai

k

-colored

K_{n}

contains a monochromatic copy of

H

colored by one of the first

s

colors or a monochromatic copy of

G

colored by one of the remaining

k - s

colors. In this paper, we determine the value of Gallai-Ramsey number in the case that

H = K_{4}^{+}

and

G = K_{3}

. Thus the Gallai-Ramsey number

g r_{k} (K_{3} : K_{4}^{+})

is obtained.

This page was built for publication: Gallai-Ramsey numbers for monochromatic $K_4^{+}$ or $K_{3}$