论文信息 - Planar Ramsey Numbers for Small Graphs

Planar Ramsey Numbers for Small Graphs

Given two graphs G1 and G2, the planar Ramsey number PR(G1, G2) is the smallest integer n such that every planar graph on n vertices either contains a copy of G1 or its complement contains a copy of G2. So far, the planar Ramsey numbers have been determined, when both, G1 and G2 are complete graphs or both are cycles. By combining computer search with some theoretical results, in this paper we compute most of the planar Ramsey numbers PR(G1, G2), where each of G1 and G2 is a complete graph, a cycle or a complete graph without one edge.

Andrzej Dudek | Andrzej Ruciński | A. Rucinski | A. Dudek

[1] Reinhard Diestel,et al. Graph Theory , 1997 .

[2] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[3] Halina Bielak,et al. The planar Ramsey number for C4 and K5 is 13 , 2001, Discret. Math..

[4] Halina Bielak. A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs , 1999, Discuss. Math. Graph Theory.

[5] K. Walker,et al. The Analogue of Ramsey Numbers for Planar Graphs , 1969 .