{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:13:49Z","timestamp":1761808429206},"reference-count":16,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove the Erd\u0151s\u2013S\u00f3s conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number of large trees whose maximum degree is bounded by a constant.<\/jats:p>","DOI":"10.1017\/s0963548320000528","type":"journal-article","created":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T08:55:13Z","timestamp":1612169713000},"page":"741-761","update-policy":"http:\/\/dx.doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":10,"title":["On the Erd\u0151s\u2013S\u00f3s conjecture for trees with bounded degree"],"prefix":"10.1017","volume":"30","author":[{"given":"Guido","family":"Besomi","sequence":"first","affiliation":[]},{"given":"Mat\u00edas","family":"Pavez-Sign\u00e9","sequence":"additional","affiliation":[]},{"given":"Maya","family":"Stein","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2021,2,1]]},"reference":[{"key":"S0963548320000528_ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1997.1758"},{"key":"S0963548320000528_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02024498"},{"key":"S0963548320000528_ref8","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22511"},{"key":"S0963548320000528_ref4","first-page":"29","volume-title":"Theory of Graphs and its Applications (Proc. Sympos. Smolenice)","author":"Erd\u0151s","year":"1964"},{"key":"S0963548320000528_ref13","unstructured":"[13] Reed, B. and Stein, M. (2019) Spanning trees in graphs of high minimum degree with a universal vertex I: An approximate asymptotic result. arXiv:1905.09801"},{"key":"S0963548320000528_ref7","doi-asserted-by":"publisher","DOI":"10.37236\/5405"},{"key":"S0963548320000528_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00207-D"},{"key":"S0963548320000528_ref6","unstructured":"[6] Erd\u0151s, P. and Graham, R. L. (1975) On partition theorems for finite graphs. In Infinite and Finite sets (Colloq. Keszthely, 1973), Vol. 10 of Colloquia Mathematica Societatis J\u00e1nos Bolyai, pp. 515\u2013527. North-Holland."},{"key":"S0963548320000528_ref2","doi-asserted-by":"publisher","DOI":"10.1137\/18M1210861"},{"key":"S0963548320000528_ref11","doi-asserted-by":"publisher","DOI":"10.1137\/100805753"},{"key":"S0963548320000528_ref14","doi-asserted-by":"publisher","DOI":"10.1137\/18M118195X"},{"key":"S0963548320000528_ref16","unstructured":"[16] Szemer\u00e9di, E. (1978) Regular partitions of graphs. In Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Vol. 260 of Colloq. Internat. CNRS, pp. 399\u2013401. CNRS."},{"key":"S0963548320000528_ref1","unstructured":"[1] Ajtai, M. , Koml\u00f3s, J. and Szemer\u00e9di, E. (1995) On a conjecture of Loebl. In Graph Theory, Combinatorics, and Algorithms (Kalamazoo, MI, 1992), pp. 1135\u20131146. Wiley-Interscience."},{"key":"S0963548320000528_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2019.106793"},{"key":"S0963548320000528_ref9","doi-asserted-by":"publisher","DOI":"10.1137\/140982878"},{"key":"S0963548320000528_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45878-6_3"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548320000528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T13:36:03Z","timestamp":1628256963000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548320000528\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,1]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["S0963548320000528"],"URL":"https:\/\/doi.org\/10.1017\/s0963548320000528","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,1]]},"assertion":[{"value":"\u00a9 The Author(s), 2021. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}