Back to Search
Start Over
Some three-color Ramsey numbers, R(P4,P5,Ck) and R(P4,P6,Ck)
- Source :
-
European Journal of Combinatorics . Feb2009, Vol. 30 Issue 2, p396-403. 8p. - Publication Year :
- 2009
-
Abstract
- Abstract: For given graphs , the three-color Ramsey number is defined to be the least positive integer such that every 3-coloring of the edges of complete graph contains a monochromatic copy of colored with , for some . In this paper, we prove that , , , , for ; , , for . [Copyright &y& Elsevier]
- Subjects :
- *RAMSEY numbers
*CHARTS, diagrams, etc.
*COLORING matter
*RESEARCH
Subjects
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 30
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 35632427
- Full Text :
- https://doi.org/10.1016/j.ejc.2008.05.008