Proof of a Conjecture on Online Ramsey Numbers of Paths

Yanbo Zhang, Yixin Zhang

For two graphs $G_1$ and $G_2$, the online Ramsey number $\tilde{r}(G_1,G_2)$ is the smallest number of edges that Builder draws on an infinite empty graph to guarantee that there…