Online Ramsey theory for planar graphs (Q405170): Difference between revisions

Summary: An online Ramsey game \((G,\mathcal{H})\) is a game between Builder and Painter, alternating in turns. During each turn, Builder draws an edge, and Painter colors it blue or red. Builder's goal is to force Painter to create a monochromatic copy of \(G\), while Painter's goal is to prevent this. The only limitation for Builder is that after each of his moves, the resulting graph has to belong to the class of graphs \(\mathcal{H}\). It was conjectured by \textit{J. A. Grytczuk} et al. [Electron. J. Comb. 11, No. 1, Research paper R57, 10 p. (2004; Zbl 1057.05058)] that if \(\mathcal{H}\) is the class of planar graphs, then Builder can force a monochromatic copy of a planar graph \(G\) if and only if \(G\) is outerplanar. Here we show that the ``only if'' part does not hold while the ``if'' part does.