Planar Ramsey Numbers
β
R. Steinberg; C.A. Tovey
π
Article
π
1993
π
Elsevier Science
π
English
β 240 KB
The planar Ramsey number \(P R(k, l)(k, l \geqslant 2)\) is the smallest integer \(n\) such that any planar graph on \(n\) vertices contains either a complete graph on \(k\) vertices or an independent set of size \(l\). We find exact values of \(P R(k, l)\) for all \(k\) and \(l\). Included is a pro