Back to Search
Start Over
The Ramsey numbers of stars versus wheels
- Source :
-
European Journal of Combinatorics . Oct2004, Vol. 25 Issue 7, p1067-1075. 9p. - Publication Year :
- 2004
-
Abstract
- For two given graphs <f>G1</f> and <f>G2</f>, the Ramsey number <f>R(G1,G2)</f> is the smallest positive integer <f>n</f> such that for any graph <f>G</f> of order <f>n</f>, either <f>G</f> contains <f>G1</f> or the complement of <f>G</f> contains <f>G2</f>. Let <f>Sn</f> denote a star of order <f>n</f> and <f>Wm</f> a wheel of order <f>m+1</f>. This paper shows that <f>R(Sn,W6)=2n+1</f> for <f>n≥3</f> and <f>R(Sn,Wm)=3n-2</f> for <f>m</f> odd and <f>n≥m-1≥2</f>. [Copyright &y& Elsevier]
- Subjects :
- *RAMSEY numbers
*RAMSEY theory
*COMBINATORICS
*GRAPH theory
Subjects
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 25
- Issue :
- 7
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 14037318
- Full Text :
- https://doi.org/10.1016/j.ejc.2003.12.004