Gallai-Ramsey numbers involving a rainbow 4-path

Abstract: Given two non-empty graphs

G, H

and a positive integer

k

, the Gallai-Ramsey number

o p e r a t o r n a m e {g r}_{k} (G : H)

is defined as the minimum integer

N

such that for all

n g e q N

, every

k

-edge-coloring of

K_{n}

contains either a rainbow colored copy of

G

or a monochromatic copy of

H

. In this paper, we got some exact values or bounds for

o p e r a t o r n a m e {g r}_{k} (P_{5} : H) (k g e q 3)

if

H

is a general graph or a star with extra independent edges or a pineapple.

Recommendations

Cites work

Cited in

(21)

This page was built for publication: Gallai-Ramsey numbers involving a rainbow 4-path