{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:20:03Z","timestamp":1649006403938},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1007\/bf02986688","type":"journal-article","created":{"date-parts":[[2008,11,12]],"date-time":"2008-11-12T20:52:30Z","timestamp":1226523150000},"page":"377-382","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bounds for a Ramsey Theorem for Trees"],"prefix":"10.1007","volume":"10","author":[{"given":"C. J.","family":"Swanepoel","sequence":"first","affiliation":[]},{"given":"L. M.","family":"Pretorius","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"(3\u20134)","key":"BF02986688_CR1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02579186","volume":"3","author":"R Bicker","year":"1983","unstructured":"Bicker, R., Voigt, B.; Density theorems for finitistic trees. Combinatorica 3(3\u20134), 305\u2013313 (1983)","journal-title":"Combinatorica"},{"key":"BF02986688_CR2","unstructured":"Deuber, W.; Generalizations of Ramsey\u2019s theorem. Colloq. Math. Soc. J\u00e1nos Bolyai, 323\u2013332 (1973)"},{"key":"BF02986688_CR3","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0095-8956(75)90057-X","volume":"18","author":"W Deuber","year":"1975","unstructured":"Deuber, W.; A generalization of Ramsey\u2019s theorem for regular trees. J. Comb. Theory Ser. B 18, 18\u201323 (1975)","journal-title":"J. Comb. Theory Ser. B"},{"key":"BF02986688_CR4","unstructured":"Fouch\u00e9, W.L.; Canonical tree embeddings and unavoidable regularities of words. Submitted for publication"},{"key":"BF02986688_CR5","unstructured":"Fouch\u00e9, W.L.; Chain partitions of ordered sets. Submitted for publication"},{"key":"BF02986688_CR6","unstructured":"Graham, R.L., Rothschild, B.L.; Ramsey theory. Wiley, second edition, 1980"},{"key":"BF02986688_CR7","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1090\/S0002-9947-1966-0200172-2","volume":"124","author":"J.D. Halpern","year":"1966","unstructured":"Halpern, J.D., L\u00e4udili, H.; A partition theorem. Trans. Amer. Math. Soc. 124, 360\u2013367 (1966)","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF02986688_CR8","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0097-3165(91)90006-3","volume":"57","author":"G.L McColm","year":"1991","unstructured":"McColm, G.L.; A Ramseyian theorem on products of trees. J. Comb. Theory Ser. A 57, 68\u201375(1991)","journal-title":"J. Comb. Theory Ser. A"},{"key":"BF02986688_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0097-3165(79)90101-8","volume":"26","author":"K.R Milliken","year":"1979","unstructured":"Milliken, K.R.; A Ramsey theorem for trees. J. Comb. Theory Ser. A 26, 215\u2013237 (1979)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"(1)","key":"BF02986688_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1090\/S0002-9947-1981-0590416-8","volume":"263","author":"K.R Milliken","year":"1981","unstructured":"Milliken, K.R.; A partition theorem for the infinite subtrees of a tree. Trans. Amer. Math. Soc. 263(1), 137\u2013148 (January 1981)","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF02986688_CR11","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BF01191498","volume":"19","author":"J Ne\u0161et\u0159il","year":"1984","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.; Combinatorial partitions of finite posets and lattices. Algebra Universalis 19, 106\u2013119 (1984)","journal-title":"Algebra Universalis"},{"issue":"2","key":"BF02986688_CR12","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P Ramsey","year":"1930","unstructured":"Ramsey, F.P.; On a problem of formal logic. Proc. London Math. Soc. 30 (2), 264\u2013286 (1930)","journal-title":"Proc. London Math. Soc"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02986688.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02986688\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02986688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T19:55:56Z","timestamp":1558554956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02986688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":12,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["BF02986688"],"URL":"https:\/\/doi.org\/10.1007\/bf02986688","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}