Ramsey numbers of 4-uniform loose cycles

Abstract: Gy'arf'as, S'ark"ozy and Szemer'edi proved that the

2

-color Ramsey number

R (m a t h c a l C_{n}^{k}, m a t h c a l C_{n}^{k})

of a

k

-uniform loose cycle

m a t h c a l C_{n}^{k}

is asymptotically

f r a c 12 (2 k - 1) n,

generating the same result for

k = 3

due to Haxell et al. Concerning their results, it is conjectured that for every

n g e q m g e q 3

and

k g e q 3,

R(mathcal{C}^k_n,mathcal{C}^k_m)=(k-1)n+lfloorfrac{m-1}{2} floor.

In

2014

, the case

k = 3

is proved by the authors. Recently, the authors showed that this conjecture is true for

n = m g e q 2

and

k g e q 8

. In this paper, we show that the conjecture holds for

k = 4

when

n > m

or

n = m

is odd. When

n = m

is even, we show that

R (m a t h c a l C_{n}^{4}, m a t h c a l C_{n}^{4})

is between two values with difference one.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Ramsey numbers of 4-uniform loose cycles