The on-line degree Ramsey number of cycles

On-line Ramsey theory studies a graph-building game between two players. The player called Builder builds edges one at a time, and the player called Painter paints each new edge red or blue after it is built. The graph constructed is the host graph. Builder wins the game if the host graph at some point contains a monochromatic copy of a given goal graph. In the S k -game variant of the typical game, the host graph is constrained to have maximum degree no greater than k . The on-line degree Ramsey number R ̊ Δ ( G ) of a graph G is the minimum k such that Builder wins an S k -game in which G is the goal graph. In this paper, we complete the investigation begun by Butterfield et al. into the on-line degree Ramsey numbers of n -cycles. Namely, we show that R ̊ Δ ( C n ) = 4 for n ≥ 3 .