{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T18:56:01Z","timestamp":1784919361413,"version":"3.55.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2001,12,12]],"date-time":"2001-12-12T00:00:00Z","timestamp":1008115200000},"content-version":"unspecified","delay-in-days":102,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2001,9]]},"abstract":"<jats:p>In this paper we prove the following almost optimal theorem. For any \u03b4 &gt; 0, there exist \nconstants <jats:italic>c<\/jats:italic> and <jats:italic>n<\/jats:italic><jats:sub>0<\/jats:sub> such that, if <jats:italic>n<\/jats:italic> [ges     ] <jats:italic>n<\/jats:italic><jats:sub>0<\/jats:sub>, <jats:italic>T<\/jats:italic> is a tree of order <jats:italic>n<\/jats:italic> and maximum degree at most \n<jats:italic>cn<\/jats:italic>\/log <jats:italic>n<\/jats:italic>, and <jats:italic>G<\/jats:italic> is a graph of order <jats:italic>n<\/jats:italic> and minimum degree at least (1\/2 + \u03b4)<jats:italic>n<\/jats:italic>, then <jats:italic>T<\/jats:italic> is a \nsubgraph of <jats:italic>G<\/jats:italic>.<\/jats:p>","DOI":"10.1017\/s0963548301004849","type":"journal-article","created":{"date-parts":[[2008,7,28]],"date-time":"2008-07-28T10:00:45Z","timestamp":1217239245000},"page":"397-416","source":"Crossref","is-referenced-by-count":43,"title":["Spanning Trees in Dense Graphs"],"prefix":"10.1017","volume":"10","author":[{"given":"J\u00c1NOS","family":"KOML\u00d3S","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00c1BOR N.","family":"S\u00c1RK\u00d3ZY","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ENDRE","family":"SZEMER\u00c9DI","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2001,12,12]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548301004849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T19:15:42Z","timestamp":1553973342000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548301004849\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0963548301004849"],"URL":"https:\/\/doi.org\/10.1017\/s0963548301004849","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}