{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T07:21:30Z","timestamp":1781594490425,"version":"3.54.5"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $T$ be a tree with $t$ vertices. Clearly, an $n$ vertex graph contains at most $n\/t$ vertex disjoint trees isomorphic to $T$. In this paper we show that for every $\\epsilon &gt;0$, there exists a $D(\\epsilon,t)&gt;0$ such that, if $d&gt;D(\\epsilon,t)$ and $G$ is a simple $d$-regular graph on $n$ vertices, then $G$ contains at least $(1-\\epsilon)n\/t$ vertex disjoint trees isomorphic to $T$.<\/jats:p>","DOI":"10.37236\/1582","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:06:41Z","timestamp":1578708401000},"source":"Crossref","is-referenced-by-count":8,"title":["Asymptotically Optimal Tree-Packings in Regular Graphs"],"prefix":"10.37236","volume":"8","author":[{"given":"Alexander","family":"Kelmans","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dhruv","family":"Mubayi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2001,11,21]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i1r38\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i1r38\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:16:27Z","timestamp":1579324587000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v8i1r38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2001,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1582","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,11,21]]},"article-number":"R38"}}