Title of article
R(C6, K5) = 21andR(C7, K5) = 25
Author/Authors
Sheng، نويسنده , , Yang Jian and Ru، نويسنده , , Huang Yi and Min، نويسنده , , Zhang Ke، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
7
From page
561
To page
567
Abstract
The Ramsey number R(Cn, Km) is the smallest integer p such that any graph G on p vertices either contains a cycleCn with length n or contains an independent set with order m. In this paper we prove that R(Cn, K5) = 4(n − 1) + 1 (n = 6, 7).
Journal title
European Journal of Combinatorics
Serial Year
2001
Journal title
European Journal of Combinatorics
Record number
1548086
Link To Document