An online Ramsey game (G, H) is a game between Builder and Painter, alternating in turns. In each round Builder draws an edge and Painter colors it either red or blue. Builder wins if after some round there is a monochromatic copy of the graph H, otherwise Painter is the winner. The rule for Builder is that after each his move the resulting graph must belong to the class of graphs G. In this ab...

13 Darlington, C. D., Jour. Genetics, 24, 65-96 (1931). 14 Painter, T. S., Science, 73, 647-648 (1931). 16 Muller, H. J., and Painter, T. S., Z. I. A. V., 62, 316-365 (1932). 16 Dobzhansky, Th., Biol. Zbl., 52, 493-509 (1932). 17 Sivertzev-Dobzhansky, N. P., and Dobzhansky, Th., Genetics, 18, 173-192 (1933). 18 Metz, C. W., Zeit. Zellforsch., 4, 1-28 (1926). 19 Darlington, C. D., Genetics (in p...

An online Ramsey game (G,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 grap...

We study on-line version of size-Ramsey numbers of graphs defined via a game played between Builder and Painter: in one round Builder joins two vertices by an edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-...