Back to Search
Start Over
The Ramsey numbers and
- Source :
-
European Journal of Combinatorics . Jul2008, Vol. 29 Issue 5, p1337-1352. 16p. - Publication Year :
- 2008
-
Abstract
- Abstract: For two given graphs and , the Ramsey number is the smallest integer such that for any graph of order , either contains or the complement of contains . Let denote a cycle of length and a complete graph of order . In this paper we show that for and , with the former result confirming a conjecture due to Erdös, Faudree, Rousseau and Schelp that for and in the case where . [Copyright &y& Elsevier]
- Subjects :
- *GRAPH theory
*MATHEMATICAL analysis
*MATRICES (Mathematics)
*COMBINATORICS
*ALGEBRA
Subjects
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 29
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 31895792
- Full Text :
- https://doi.org/10.1016/j.ejc.2007.05.007