On Ramsey numbers of complete graphs with dropped stars

Abstract: Let

r (G, H)

be the smallest integer

N

such that for any

2

-coloring (say, red and blue) of the edges of

K_{n}

,

n g e q s l a n t N

, there is either a red copy of

G

or a blue copy of

H

. Let

K_{n} - K_{1, s}

be the complete graph on

n

vertices from which the edges of

K_{1, s}

are dropped. In this note we present exact values for

r (K_{m} - K_{1, 1}, K_{n} - K_{1, s})

and new upper bounds for

r (K_{m}, K_{n} - K_{1, s})

in numerous cases. We also present some results for the Ramsey number of Wheels versus

K_{n} - K_{1, s}

.

Recommendations

Cites Work

Cited In (2)

This page was built for publication: On Ramsey numbers of complete graphs with dropped stars