Title

On a conjecture involving cycle-complete graph Ramsey numbers

Abstract

It has been conjectured that r(Cn, Km) = (m - 1)(n - 1) + 1 for all (n, m) ≠ (3,3) satisfying n ≥ m. We prove this for the case m = 5.

Publication Title

Australasian Journal of Combinatorics

This document is currently not available here.

Share

COinS