{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:40Z","timestamp":1753893820988,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Consider the following one-player game. Starting with the empty graph on $n$ vertices, in every step $r$ new edges are drawn uniformly at random and inserted into the current graph. These edges have to be colored immediately with $r$ available colors, subject to the restriction that each color is used for exactly one of these edges. The player's goal is to avoid creating a monochromatic copy of some fixed graph $F$ for as long as possible. We prove explicit threshold functions for the duration of this game for an arbitrary number of colors $r$ and a large class of graphs $F$. This extends earlier work for the case $r=2$ by Marciniszyn, Mitsche, and Stojakovi\u0107. We also prove a similar threshold result for the vertex-coloring analogue of this game.<\/jats:p>","DOI":"10.37236\/100","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T04:36:32Z","timestamp":1578717392000},"source":"Crossref","is-referenced-by-count":9,"title":["Balanced Online Ramsey Games in Random Graphs"],"prefix":"10.37236","volume":"16","author":[{"given":"Anupam","family":"Prakash","sequence":"first","affiliation":[]},{"given":"Reto","family":"Sp\u00f6hel","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2009,1,23]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r11\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r11\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T03:14:24Z","timestamp":1579317264000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v16i1r11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,23]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2009,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/100","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2009,1,23]]},"article-number":"R11"}}