On three-color Ramsey number of paths

Abstract: Let

G_{1}, G_{2}, ..., G_{t}

be graphs. The multicolor Ramsey number

R (G_{1}, G_{2}, ..., G_{t})

is the smallest positive integer

n

such that if the edges of complete graph

K_{n}

are partitioned into

t

disjoint color classes giving

t

graphs

H_{1}, H_{2}, ..., H_{t}

, then at least one

H_{i}

has a subgraph isomorphic to

G_{i}

. In this paper, we prove that if

(n, m) e q (3, 3), (3, 4)

and

m g e q n

, then

R (P_{3}, P_{n}, P_{m}) = R (P_{n}, P_{m}) = m + l f l o o r f r a c n 2 f l o o r - 1

. Consequently

R (P_{3}, m K_{2}, n K_{2}) = 2 m + n - 1

for

m g e q n g e q 3

.

Cites Work

Cited In (9)

This page was built for publication: On three-color Ramsey number of paths