{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T05:32:08Z","timestamp":1770701528767,"version":"3.49.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00493-010-2436-z","type":"journal-article","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T07:08:06Z","timestamp":1284620886000},"page":"105-123","source":"Crossref","is-referenced-by-count":4,"title":["Online vertex-coloring games in random graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Martin","family":"Marciniszyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reto","family":"Sp\u00f6hel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,17]]},"reference":[{"issue":"2","key":"2436_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1017\/S0305004100058655","volume":"90","author":"B. Bollob\u00e1s","year":"1981","unstructured":"B. Bollob\u00e1s: Threshold functions for small subgraphs, Math. Proc. Cambridge Philos. Soc. 90(2) (1981), 197\u2013206.","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"1\u20132","key":"2436_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/rsa.20042","volume":"26","author":"E. Friedgut","year":"2005","unstructured":"E. Friedgut: Hunting for sharp thresholds, Random Structures & Algorithms 26(1\u20132) (2005), 37\u201351.","journal-title":"Random Structures & Algorithms"},{"issue":"5\u20136","key":"2436_CR3","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1017\/S0963548303005881","volume":"12","author":"E. Friedgut","year":"2003","unstructured":"E. Friedgut, Y. Kohayakawa, V. R\u00f6dl, A. Ruci\u0144ski and P. Tetali: Ramsey games against a one-armed bandit, Combinatorics, Probability and Computing 12(5\u20136) (2003), 515\u2013545.","journal-title":"Combinatorics, Probability and Computing"},{"issue":"2","key":"2436_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/rsa.3240010209","volume":"1","author":"S. Janson","year":"1990","unstructured":"S. Janson: Poisson approximation for large deviations, Random Structures & Algorithms 1(2) (1990), 221\u2013229.","journal-title":"Random Structures & Algorithms"},{"issue":"1","key":"2436_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0095-8956(92)90006-J","volume":"56","author":"T. \u0141uczak","year":"1992","unstructured":"T. \u0141uczak, A. Ruci\u0144ski and B. Voigt: Ramsey properties of random graphs, J. Combin. Theory Ser. B 56(1) (1992), 55\u201368.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2436_CR6","unstructured":"M. Marciniszyn and R. Sp\u00f6hel: Online vertex colorings of random graphs without monochromatic subgraphs, in: Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pages 486\u2013493, 2007."},{"issue":"1\u20132","key":"2436_CR7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1017\/S0963548308009632","volume":"18","author":"M. Marciniszyn","year":"2009","unstructured":"M. Marciniszyn, R. Sp\u00f6hel and A. Steger: Online Ramsey games in random graphs, Combinatorics, Probability and Computing 18(1\u20132) (2009), 271\u2013300.","journal-title":"Combinatorics, Probability and Computing"},{"issue":"1\u20132","key":"2436_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1017\/S0963548308009620","volume":"18","author":"M. Marciniszyn","year":"2009","unstructured":"M. Marciniszyn, R. Sp\u00f6hel and A. Steger: Upper bounds for online Ramsey games in random graphs, Combinatorics, Probability and Computing 18(1\u20132) (2009), 259\u2013270.","journal-title":"Combinatorics, Probability and Computing"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2436-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-010-2436-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2436-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:47Z","timestamp":1559079167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-010-2436-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["2436"],"URL":"https:\/\/doi.org\/10.1007\/s00493-010-2436-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}