1 paper
Ruyu Song, Sha Wang, Yanbo Zhang
Given two graphs G and H, the online Ramsey number r~(G,H) is defined to be the minimum number of rounds that Builder can always guarantee a win in the following $(G,…