Degree bipartite Ramsey numbers

Abstract: Let

H x r i g h t a r r o w s G

denote that any edge-coloring of

H

by

s

colors contains a monochromatic

G

. The degree Ramsey number

r_{D e l t a} (G; s)

is defined to be

m i n D e l t a (H) : H x r i g h t a r r o w s G

, and the degree bipartite Ramsey number

b r_{D e l t a} (G; s)

is defined to be

m i n D e l t a (H) : H x r i g h t a r r o w s G; m b o x a n d; c h i (H) = 2

. In this note, we show that

r_{D e l t a} (K_{m, n}; s)

is linear on

n

with

m

fixed. We also determine

b r_{D e l t a} (G; s)

where

G

are trees, including stars and paths, and complete bipartite graphs.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Degree bipartite Ramsey numbers