Abstract
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 Sk-game variant of the typical game, the host graph is constrained to have maximum degree no greater than k. The on-line degree Ramsey numberR̊Δ(G) of a graph G is the minimum k such that Builder wins an Sk-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̊Δ(Cn)=4 for n≥3.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
