Gallai-Ramsey number of an 8-cycle

Publication date 1 September 2021

Abstract: Given graphs

G

and

H

and a positive integer

k

, the Gallai-Ramsey number

g r_{k} (G : H)

is the minimum integer

N

such that for any integer

n g e q N

, every

k

-edge-coloring of

K_{n}

contains either a rainbow copy of

G

or a monochromatic copy of

H

. These numbers have recently been studied for the case when

G = K_{3}

, where still only a few precise numbers are known for all

k

. In this paper, we extend the known precise Gallai-Ramsey numbers to include

H = C_{8}

for all

k

.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Gallai-Ramsey number of an 8-cycle