Off-diagonal graph Ramsey number ( $r (G, H)$ )

The Ramsey number

r (G, H)

is the least

n

such that every red-blue colouring of

K_{n}

contains a red copy of

G

or a blue copy of

H

.

Table of contents
- Clique-path Ramsey number Off-diagonal graph Ramsey number

Clique-path Ramsey number ( $r (K_{s}, P_{t})$ )

If

P_{t}

denotes a path of length

t

, then

r (K_{s}, P_{t}) = (s - 1) t + 1

for

s \geq 2

and

t \geq 1

.

 Ancestors (7)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version