{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:08:19Z","timestamp":1725872899075},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662540688"},{"type":"electronic","value":"9783662540695"}],"license":[{"start":{"date-parts":[[2016,12,3]],"date-time":"2016-12-03T00:00:00Z","timestamp":1480723200000},"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":[[2017]]},"DOI":"10.1007\/978-3-662-54069-5_2","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T03:43:15Z","timestamp":1480650195000},"page":"19-22","source":"Crossref","is-referenced-by-count":0,"title":["Ramsey Theory on Trees and Applications"],"prefix":"10.1007","author":[{"given":"Natasha","family":"Dobrinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s00493-013-2773-9","volume":"33","author":"A Avil\u00e9s","year":"2013","unstructured":"Avil\u00e9s, A., Todorcevic, S.: Finite basis for analytic strong $$n$$ -gaps. Combinatorica 33(4), 375\u2013393 (2013)","journal-title":"Combinatorica"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.aim.2016.02.004","volume":"292","author":"A Avil\u00e9s","year":"2016","unstructured":"Avil\u00e9s, A., Todorcevic, S.: Types in the $$n$$ -adic tree and minimal analytic gaps. Adv. Math. 292, 558\u2013600 (2016)","journal-title":"Adv. Math."},{"key":"2_CR3","unstructured":"Dobrinen, N.: The universal triangle-free graph has finite Ramsey degrees. (2016, in preparation)"},{"key":"2_CR4","unstructured":"Dobrinen, N., Hathaway, D.: The Halpern-L\u00e4uchli Theorem at a measurable cardinal (2016, submitted). 15 pages"},{"issue":"11","key":"2_CR5","doi-asserted-by":"crossref","first-page":"2848","DOI":"10.1016\/j.disc.2016.04.021","volume":"339","author":"N Dobrinen","year":"2016","unstructured":"Dobrinen, N., Laflamme, C., Sauer, N.: Rainbow Ramsey simple structures. Discrete Math. 339(11), 2848\u20132855 (2016)","journal-title":"Discrete Math."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s11856-009-0049-2","volume":"171","author":"M D\u017eamonja","year":"2009","unstructured":"D\u017eamonja, M., Larson, J., Mitchell, W.J.: A partition theorem for a large dense linear order. Israel J. Math. 171, 237\u2013284 (2009)","journal-title":"Israel J. Math."},{"issue":"6","key":"2_CR7","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s00153-009-0138-2","volume":"48","author":"M D\u017eamonja","year":"2009","unstructured":"D\u017eamonja, M., Larson, J., Mitchell, W.J.: Partitions of large Rado graphs. Arch. Math. Logic 48(6), 579\u2013606 (2009)","journal-title":"Arch. Math. Logic"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1090\/S0002-9947-1966-0200172-2","volume":"124","author":"JD Halpern","year":"1966","unstructured":"Halpern, J.D., L\u00e4uchli, H.: A partition theorem. Trans. Am. Math. Soc. 124, 360\u2013367 (1966)","journal-title":"Trans. Am. Math. Soc."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Halpern, J.D., L\u00e9vy, A.: The Boolean prime ideal theorem does not imply the axiom of choice. In: Axiomatic Set Theory, pp. 83\u2013134. American Mathematical Society (1971). Proceedings of the Symposium on Pure Mathematics, Vol. XIII, Part I, University California, Los Angeles, Calififornia (1967)","DOI":"10.1090\/pspum\/013.1\/0284328"},{"issue":"1","key":"2_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.2140\/pjm.1971.38.69","volume":"38","author":"CW Henson","year":"1971","unstructured":"Henson, C.W.: A family of countable homogeneous graphs. Pac. J. Math. 38(1), 69\u201383 (1971)","journal-title":"Pac. J. Math."},{"issue":"1","key":"2_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01788077","volume":"2","author":"P Komj\u00e1th","year":"1986","unstructured":"Komj\u00e1th, P., R\u00f6dl, V.: Coloring of universal graphs. Graphs Comb. 2(1), 55\u201360 (1986)","journal-title":"Graphs Comb."},{"issue":"2","key":"2_CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s00493-006-0013-2","volume":"26","author":"C Laflamme","year":"2006","unstructured":"Laflamme, C., Sauer, N., Vuksanovic, V.: Canonical partitions of universal structures. Combinatorica 26(2), 183\u2013205 (2006)","journal-title":"Combinatorica"},{"issue":"1","key":"2_CR13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1090\/S0002-9947-1981-0590416-8","volume":"263","author":"KR Milliken","year":"1981","unstructured":"Milliken, K.R.: A partition theorem for the infinite subtrees of a tree. Trans. Am. Math. Soc. 263(1), 137\u2013148 (1981)","journal-title":"Trans. Am. Math. Soc."},{"key":"2_CR14","first-page":"264","volume":"30","author":"FP Ramsey","year":"1929","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lon. Math. Soc. 30, 264\u2013296 (1929)","journal-title":"Proc. Lon. Math. Soc."},{"issue":"1\u20133","key":"2_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0012-365X(97)00169-6","volume":"185","author":"N Sauer","year":"1998","unstructured":"Sauer, N.: Edge partitions of the countable triangle free homogenous graph. Discrete Math. 185(1\u20133), 137\u2013181 (1998)","journal-title":"Discrete Math."},{"issue":"2","key":"2_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00493-006-0015-0","volume":"26","author":"N Sauer","year":"2006","unstructured":"Sauer, N.: Coloring subgraphs of the Rado graph. Combinatorica 26(2), 231\u2013253 (2006)","journal-title":"Combinatorica"},{"key":"2_CR17","unstructured":"Shelah, S.: Strong partition relations below the power set: consistency - was Sierpinski right? II. In: Sets, Graphs and Numbers, Budapest, vol. 60, pp. 637\u2013688 (1991). Colloq. Math. Soc. J\u00e1nos Bolyai, North-Holland"},{"key":"2_CR18","doi-asserted-by":"crossref","DOI":"10.1515\/9781400835409","volume-title":"Introduction to Ramsey Spaces","author":"S Todorcevic","year":"2010","unstructured":"Todorcevic, S.: Introduction to Ramsey Spaces. Princeton University Press, Princeton (2010)"},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1016\/j.aim.2015.08.021","volume":"285","author":"S Todorcevic","year":"2015","unstructured":"Todorcevic, S., Tyros, K.: A disjoint unions theorem for threes. Adv. Math. 285, 1487\u20131510 (2015)","journal-title":"Adv. Math."},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.disc.2014.07.007","volume":"335","author":"D Vlitas","year":"2014","unstructured":"Vlitas, D.: A canonical partition relation for uniform families of finite strong subtrees. Discrete Math. 335, 45\u201365 (2014)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54069-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T01:53:28Z","timestamp":1568598808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54069-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,3]]},"ISBN":["9783662540688","9783662540695"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54069-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,3]]}}}