On Star-critical (K1,n,K1,m + e) Ramsey numbers

Abstract: Let

G, H

be finite graphs without loops or multiple edges and

K_{n}

denote the complete graph on

n

vertices. If for every red/blue colouring of edges of the complete graph

K_{n}

, there exists a red copy of

G

, or a blue copy of

H

, we will say that

K_{n} i g h t a r r o w (G, H)

. The Ramsey number

r (G, H)

is defined as the smallest positive integer

n

such that

K_{n} i g h t a r r o w (G, H)

. Star-critical Ramsey number

r_{*} (G, H)

is defined as the largest value of

k

such that

K_{r (G, H) - 1} s q c u p K_{1, k} i g h t a r r o w (G, H)

. In this paper, we will find

r_{*} (K_{1, n}, K_{1, m} + e)

for all

n, m g e q 3

.

This page was built for publication: On Star-critical (K1,n,K1,m + e) Ramsey numbers