{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T05:18:59Z","timestamp":1675401539969},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00493-022-5036-9","type":"journal-article","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T12:03:48Z","timestamp":1663761828000},"page":"1189-1229","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Component Games on Random Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Rani","family":"Hod","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Krivelevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Wormald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"5036_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1002\/rsa.20494","volume":"46","author":"D Achlioptas","year":"2015","unstructured":"D. Achlioptas and M. Molloy: The solution space geometry of random linear equations, Random Structures and Algorithms 46 (2015), 197\u2013231.","journal-title":"Random Structures and Algorithms"},{"key":"5036_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/1098-2418(200103)18:2<141::AID-RSA1002>3.0.CO;2-W","volume":"18","author":"M Bednarska","year":"2001","unstructured":"M. Bednarska and Tomasz \u0141uczak: Biased positional games and the phase transition, Random Structures and Algorithms 18 (2001), 141\u2013152.","journal-title":"Random Structures and Algorithms"},{"key":"5036_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735202","volume-title":"Combinatorial Games: Tic-Tac-Toe Theory","author":"J Beck","year":"2008","unstructured":"J. Beck: Combinatorial Games: Tic-Tac-Toe Theory, Cambridge University Press, New York, 2008."},{"key":"5036_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","volume":"1","author":"B Bollob\u00e1s","year":"1980","unstructured":"B. Bollob\u00e1s: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J. Combinatorics 1 (1980), 311\u2013316.","journal-title":"European J. Combinatorics"},{"key":"5036_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0167-5060(08)70335-2","volume":"2","author":"V Chv\u00e1tal","year":"1978","unstructured":"V. Chv\u00e1tal and P. Erd\u0151s: Biased positional games, Ann. Discrete Math. 2 (1978), 221\u2013228.","journal-title":"Ann. Discrete Math."},{"key":"5036_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/aama.2001.0720","volume":"26","author":"F Chung","year":"2001","unstructured":"F. Chung and L. Lu: The diameter of sparse random graphs, Advances in Applied Math 26 (2001), 257\u2013279.","journal-title":"Advances in Applied Math"},{"key":"5036_CR7","doi-asserted-by":"publisher","first-page":"P81","DOI":"10.37236\/1107","volume":"13","author":"J Cain","year":"2006","unstructured":"J. Cain and N. Wormald: Encores on cores, Electronic J. Combinatorics 13 (2006), P81.","journal-title":"Electronic J. Combinatorics"},{"key":"5036_CR8","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1002\/rsa.20528","volume":"46","author":"A Ferber","year":"2015","unstructured":"A. Ferber, R. Glebov, M. Krivelevich and A. Naor: Biased games on random boards, Random Structures and Algorithms 46 (2015), 651\u2013676.","journal-title":"Random Structures and Algorithms"},{"key":"5036_CR9","doi-asserted-by":"crossref","unstructured":"A. Frieze and M. Karo\u0144ski: Introduction to random graphs, Cambridge University Press, 2015.","DOI":"10.1017\/CBO9781316339831"},{"key":"5036_CR10","unstructured":"P. Gao: Analysis of the parallel peeling algorithm: a short proof, arXiv:1402.7326"},{"key":"5036_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/rsa.20279","volume":"35","author":"H Gebauer","year":"2009","unstructured":"H. Gebauer and T. Szab\u00f3: Asymptotic random graph intuition for the biased connectivity game, Random Structures and Algorithms 35 (2009), 431\u2013443.","journal-title":"Random Structures and Algorithms"},{"key":"5036_CR12","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ejc.2010.09.005","volume":"32","author":"D Hefetz","year":"2011","unstructured":"D. Hefetz, M. Krivelevich, M. Stojakovi\u0107 and T. Szab\u00f3: Global Maker-Breaker games on sparse graphs, European J. Combinatorics 32 (2011), 162\u2013177.","journal-title":"European J. Combinatorics"},{"key":"5036_CR13","series-title":"Oberwolfach Seminars","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-0825-5","volume-title":"Positional Games","author":"D Hefetz","year":"2014","unstructured":"D. Hefetz, M. Krivelevich, M. Stojakovi\u0107 and T. Szab\u00f3: Positional Games, Oberwolfach Seminars, vol. 44, Birkh\u00e4user Basel (Springer), 2014."},{"key":"5036_CR14","doi-asserted-by":"publisher","first-page":"P61","DOI":"10.37236\/2129","volume":"19","author":"D Hefetz","year":"2012","unstructured":"D. Hefetz, M. Mikala\u010dki and M. Stojakovi\u0107: Doubly biased Maker-Breaker Connectivity game, Electronic J. Combinatorics 19 (2012), P61.","journal-title":"Electronic J. Combinatorics"},{"key":"5036_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0963548313000527","volume":"23","author":"R Hod","year":"2014","unstructured":"R. Hod and A. Naor: Component games on regular graphs, Combinatorics, Probability and Computing 23 (2014), 75\u201389.","journal-title":"Combinatorics, Probability and Computing"},{"key":"5036_CR16","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/rsa.20147","volume":"30","author":"S Janson","year":"2007","unstructured":"S. Janson and M. J. Luczak: A simple solution to the k-core problem, Random Structures and Algorithms 30 (2007), 50\u201362.","journal-title":"Random Structures and Algorithms"},{"key":"5036_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2938412","volume":"3","author":"J Jiang","year":"2016","unstructured":"J. Jiang, M. Mitzenmacher and J. Thaler: Parallel peeling algorithms, ACM Trans. Parallel Comput. 3 (2016), #7, 1\u201327.","journal-title":"ACM Trans. Parallel Comput."},{"key":"5036_CR18","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/0112059","volume":"12","author":"A Lehman","year":"1964","unstructured":"A. Lehman: A solution of the Shannon switching game, J. Soc. Indust. Appl. Math. 12 (1964), 687\u2013725.","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"5036_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0012-365X(91)90162-U","volume":"91","author":"T \u0141uczak","year":"1991","unstructured":"T. \u0141uczak: Size and connectivity of the k-core of a random graph, Discrete Math. 91 (1991), 61\u201368.","journal-title":"Discrete Math."},{"key":"5036_CR20","unstructured":"T. \u0141uczak: Sparse random graphs with a given degree sequence, in: Random Graphs: Volume 2 (A. Frieze and T. \u0141uczak, eds.), 165\u2013182, John Wiley & Sons, 1992."},{"key":"5036_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"M. Molloy and B. Reed: A critical point for random graphs with a given degree sequence, Random Structures and Algorithms 6 (1995), 161\u2013180.","journal-title":"Random Structures and Algorithms"},{"key":"5036_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C St J A Nash Williams","year":"1961","unstructured":"C. St. J. A. Nash Williams: Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), 445\u2013450.","journal-title":"J. London Math. Soc."},{"key":"5036_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jctb.1996.0036","volume":"67","author":"B Pittel","year":"1996","unstructured":"B. Pittel, J. Spencer and N. Wormald: Sudden emergence of a giant k-core in a random graph, J. Combinatorial Theory Series B 67 (1996), 111\u2013151.","journal-title":"J. Combinatorial Theory Series B"},{"key":"5036_CR24","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00493-011-2545-3","volume":"31","author":"P Pra\u0142at","year":"2011","unstructured":"P. Pra\u0142at, J. Verstra\u00ebte and N. Wormald: On the threshold for k-regular subgraphs of random graphs, Combinatorica 31 (2011), 565\u2013581.","journal-title":"Combinatorica"},{"key":"5036_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1017\/S0963548307008589","volume":"17","author":"O Riordan","year":"2008","unstructured":"O. Riordan: The k-core and branching processes, Combinatorics, Probability and Computing 17 (2008), 111\u2013138.","journal-title":"Combinatorics, Probability and Computing"},{"key":"5036_CR26","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1002\/rsa.20059","volume":"26","author":"M Stojakovi\u0107","year":"2005","unstructured":"M. Stojakovi\u0107 and T. Szab\u00f3: Positional games on random graphs, Random Structures and Algorithms 26 (2005), 204\u2013223.","journal-title":"Random Structures and Algorithms"},{"key":"5036_CR27","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W T Tutte","year":"1961","unstructured":"W. T. Tutte: On the problem of decomposing a graph into n connected factors, J. London Math. Soc. 36 (1961), 221\u2013230.","journal-title":"J. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-022-5036-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-022-5036-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-022-5036-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T16:31:32Z","timestamp":1675355492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-022-5036-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,21]]},"references-count":27,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["5036"],"URL":"https:\/\/doi.org\/10.1007\/s00493-022-5036-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,21]]},"assertion":[{"value":"12 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}