Improved bounds on the Ramsey number of fans

Abstract: For a given graph

H

, the Ramsey number

r (H)

is the minimum

N

such that any 2-edge-coloring of the complete graph

K_{N}

yields a monochromatic copy of

H

. Given a positive integer

n

, a emph{fan }

F_{n}

is a graph formed by

n

triangles that share one common vertex. We show that

9 n / 2 - 5 l e r (F_{n}) l e 11 n / 2 + 6

for any

n

. This improves previous best bounds

r (F_{n}) l e 6 n

of Lin and Li and

r (F_{n}) g e 4 n + 2

of Zhang, Broersma and Chen.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Improved bounds on the Ramsey number of fans