Back to Search
Start Over
Complete Graph-Tree Planar Ramsey Numbers.
- Source :
-
Graphs & Combinatorics . Nov2019, Vol. 35 Issue 6, p1659-1671. 13p. - Publication Year :
- 2019
-
Abstract
- For two given graphs G 1 and G 2 , the planar Ramsey number P R (G 1 , G 2) is the smallest integer N such that every planar graph G on N vertices either contains a copy of G 1 or its complement contains a copy of G 2 . In this paper, we determine all planar Ramsey numbers for the complete graphs versus trees. [ABSTRACT FROM AUTHOR]
- Subjects :
- *PLANAR graphs
*RAMSEY numbers
*COMPLETE graphs
*TREE graphs
*INTEGERS
Subjects
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 35
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 139843652
- Full Text :
- https://doi.org/10.1007/s00373-019-02088-1