A Note on Restricted Online Ramsey Numbers of Matchings
A Note on Restricted Online Ramsey Numbers of Matchings
Consider the following game between Builder and Painter. We take some families of graphs $\mathcal{G}_{1},\ldots,\mathcal{G}_t$ and an integer $n$ such that $n \geq R(\mathcal{G}_1,\ldots,\mathcal{G}_t)$. In each turn, Builder picks an edge of initially uncoloured $K_n$ and Painter colours that edge with some colour $i \in \left\{ 1,\ldots,t \right\}$ of her …