Planar Ramsey Numbers

Planar Ramsey Numbers
复制标题

DOI:
10.7151/dmgt.1258
复制
发表时间:
2005
期刊:
Discuss. Math. Graph Theory
影响因子:
--
通讯作者:
Izolda Gorgol
Izolda Gorgol
中科院分区:
其他
文献类型:
--
作者:
Izolda Gorgol

文献摘要

被引文献

相似文献

平面Ramsey数PR(G,H)被定义为最小整数n,对于该最小整数n,Kn的任何边用红色和蓝色2-着色,其中红色边诱导平面图,导致G的红色副本或蓝色H。本文研究了第二类图是完全图时平面Ramsey数的弱诱导形式。
The planar Ramsey number PR(G, H) is defined as the smallest integer n for which any 2-colouring of edges of Kn 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.