A note on Gallai-Ramsey number of even wheels

Abstract: A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai

k

-coloring is a Gallai coloring that uses

k

colors. Given a graph

H

and an integer

k g e q 1

, the Gallai-Ramsey number

G R_{k} (H)

of

H

is the least positive integer

N

such that every Gallai

k

-coloring of the complete graph

K_{N}

contains a monochromatic copy of

H

. Let

W_{2 n}

denote an even wheel on

2 n + 1 g e 5

vertices. In this note, we study Gallai-Ramsey number of

W_{2 n}

and completely determine the exact value of

G R_{k} (W_{4})

for all

k g e 2

.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: A note on Gallai-Ramsey number of even wheels