Planar Ramsey numbers
Discussiones Mathematicae. Graph Theory, Tome 25 (2005) no. 1-2, pp. 45-50

Voir la notice de l'article provenant de la source Library of Science

The planar Ramsey number PR(G,H) is defined as the smallest integer n for which any 2-colouring of edges of Kₙ with red and blue, where red edges induce a planar graph, leads to either a red copy of G, or a blue H. In this note we study the weak induced version of the planar Ramsey number in the case when the second graph is complete.
Keywords: Ramsey number, planar graph, induced subgraph
@article{DMGT_2005_25_1-2_a4,
     author = {Gorgol, Izolda},
     title = {Planar {Ramsey} numbers},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {45--50},
     publisher = {mathdoc},
     volume = {25},
     number = {1-2},
     year = {2005},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a4/}
}
TY  - JOUR
AU  - Gorgol, Izolda
TI  - Planar Ramsey numbers
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2005
SP  - 45
EP  - 50
VL  - 25
IS  - 1-2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a4/
LA  - en
ID  - DMGT_2005_25_1-2_a4
ER  - 
%0 Journal Article
%A Gorgol, Izolda
%T Planar Ramsey numbers
%J Discussiones Mathematicae. Graph Theory
%D 2005
%P 45-50
%V 25
%N 1-2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a4/
%G en
%F DMGT_2005_25_1-2_a4
Gorgol, Izolda. Planar Ramsey numbers. Discussiones Mathematicae. Graph Theory, Tome 25 (2005) no. 1-2, pp. 45-50. http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a4/