Bounds on Ramsey Games via Alterations

09/06/2019

∙

by   He Guo, et al.

∙

Georgia Institute of Technology

∙

0

∙

share

This note contains a refined alteration approach for constructing H-free graphs: we show that removing all edges in H-copies of the binomial random graph does not significantly change the independence number (for suitable edge-probabilities); previous alteration approaches of Erdos and Krivelevich remove only a subset of these edges. We present two applications to online graph Ramsey games of recent interest, deriving new bounds for Ramsey, Paper, Scissors games and online Ramsey numbers.