A note on the Ramsey number of even wheels versus stars

Abstract: For two graphs

G_{1}

and

G_{2}

the Ramsey number

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

is the smallest integer

N

, such that for any graph on

N

vertices either

G

contains

G_{1}

or

o v e r l i n e G

contains

G_{2}

. Let

S_{n}

be a star of order

n

and

W_{m}

be a wheel of order

m + 1

. In this paper, it is shown that

R (W_{n}, S_{n}) l e q 5 n / 2 - 1

, where

n g e q 6

is even. It was proven a theorem which implies that

R (W_{n}, S_{n}) g e q 5 n / 2 - 2

, where

n g e q 6

is even. Therefore we conclude that

R (W_{n}, S_{n}) = 5 n / 2 - 2

or

5 n / 2 - 1

, for

n g e q 6

and even.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: A note on the Ramsey number of even wheels versus stars