On path-quasar Ramsey numbers

Abstract: Let

G_{1}

and

G_{2}

be two given graphs. The Ramsey number

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

is the least integer

r

such that for every graph

G

on

r

vertices, either

G

contains a

G_{1}

or

o v e r l i n e G

contains a

G_{2}

. Parsons gave a recursive formula to determine the values of

R (P_{n}, K_{1, m})

, where

P_{n}

is a path on

n

vertices and

K_{1, m}

is a star on

m + 1

vertices. In this note, we first give an explicit formula for the path-star Ramsey numbers. Secondly, we study the Ramsey numbers

R (P_{n}, K_{1} v e e F_{m})

, where

F_{m}

is a linear forest on

m

vertices. We determine the exact values of

R (P_{n}, K_{1} v e e F_{m})

for the cases

m l e q n

and

m g e q 2 n

, and for the case that

F_{m}

has no odd component. Moreover, we give a lower bound and an upper bound for the case

n + 1 l e q m l e q 2 n - 1

and

F_{m}

has at least one odd component.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: On path-quasar Ramsey numbers