{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:08:04Z","timestamp":1725538084660},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_8","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T10:05:18Z","timestamp":1252922718000},"page":"74-83","source":"Crossref","is-referenced-by-count":3,"title":["Martingales on Trees and the Empire Chromatic Number of Random Trees"],"prefix":"10.1007","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew R. A.","family":"McGrae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Zito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-27821-4_20","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"D. Achlioptas","year":"2004","unstructured":"Achlioptas, D., Moore, C.: The chromatic number of random regular graphs. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 219\u2013228. Springer, Heidelberg (2004)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.4007\/annals.2005.162.1335","volume":"162","author":"D. Achlioptas","year":"2005","unstructured":"Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. Annals of Mathematics\u00a0162, 1335\u20131351 (2005)","journal-title":"Annals of Mathematics"},{"key":"8_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-211-75357-6","volume-title":"Random Trees","author":"M. Drmota","year":"2009","unstructured":"Drmota, M.: Random Trees. Springer, Wien (2009)"},{"key":"8_CR4","first-page":"332","volume":"24","author":"P.J. Heawood","year":"1890","unstructured":"Heawood, P.J.: Map colour theorem. Quarterly Journal of Pure and Applied Mathematics\u00a024, 332\u2013338 (1890)","journal-title":"Quarterly Journal of Pure and Applied Mathematics"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2307\/2690733","volume":"66","author":"J.P. Hutchinson","year":"1993","unstructured":"Hutchinson, J.P.: Coloring ordinary maps, maps of empires, and maps of the moon. Mathematics Magazine\u00a066, 211\u2013226 (1993)","journal-title":"Mathematics Magazine"},{"key":"8_CR6","first-page":"146","volume":"347","author":"B. Jackson","year":"1984","unstructured":"Jackson, B., Ringel, G.: Solution of Heawood\u2019s empire problem in the plane. Journal f\u00fcr die Reine und Angewandte Mathematik\u00a0347, 146\u2013153 (1984)","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/rsa.3240070105","volume":"7","author":"A. Kamath","year":"1995","unstructured":"Kamath, A., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures and Algorithms\u00a07, 59\u201380 (1995)","journal-title":"Random Structures and Algorithms"},{"key":"8_CR8","volume-title":"A First Course in Stochastic Processes","author":"S. Karlin","year":"1975","unstructured":"Karlin, S., Taylor, H.M.: A First Course in Stochastic Processes. Academic Press, New York (1975)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01205080","volume":"11","author":"T. \u0141uczak","year":"1991","unstructured":"\u0141uczak, T.: A note on the sharp concentration of the chromatic number of random graphs. Combinatorica\u00a011, 295\u2013297 (1991)","journal-title":"Combinatorica"},{"key":"8_CR10","first-page":"414","volume-title":"SODA 1992: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms","author":"C. McDiarmid","year":"1992","unstructured":"McDiarmid, C., Hayward, R.: Strong concentration for quicksort. In: SODA 1992: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pp. 414\u2013421. Society for Industrial and Applied Mathematics, Philadelphia (1992)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-85238-4_42","volume-title":"Mathematical Foundations of Computer Science 2008","author":"A.R. McGrae","year":"2008","unstructured":"McGrae, A.R., Zito, M.: Colouring random empire trees. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 515\u2013526. Springer, Heidelberg (2008)"},{"key":"8_CR12","first-page":"261","volume-title":"Graph Theory and Theoretical Physics","author":"J.W. Moon","year":"1967","unstructured":"Moon, J.W.: Enumerating labelled trees. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 261\u2013272. Academic Press, New York (1967)"},{"key":"8_CR13","unstructured":"Moon, J.W.: Counting Labelled Trees. Canadian Mathematical Congress, Montreal (1970)"},{"key":"8_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02579208","volume":"7","author":"E. Shamir","year":"1987","unstructured":"Shamir, E., Spencer, J.: Sharp concentration of the chromatic number on random graphs G\n                           \n                              n,p\n                           . Combinatorica\u00a07, 121\u2013129 (1987)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:17:48Z","timestamp":1552141068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}