Back to Search
Start Over
The planar Ramsey number.
- Source :
-
Discrete Applied Mathematics . Jul2014, Vol. 171, p28-34. 7p. - Publication Year :
- 2014
-
Abstract
- Abstract: For two given graphs and , the planar Ramsey number is the smallest integer such that for any planar graph on vertices, either contains or its complement contains . Let denote a cycle of length and a complete graph of order . Sun, Yang, Lin and Song conjectured that and the conjecture was proved for . In this paper, it is shown that which confirms the conjecture for . [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 171
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 95502845
- Full Text :
- https://doi.org/10.1016/j.dam.2014.02.002