{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:38Z","timestamp":1753893818977,"version":"3.41.2"},"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>For $p\\ge 1$, we prove that every forest with $p$ trees whose sizes are $a_1, \\ldots, a_p$ can be embedded in any graph containing at least $\\sum_{i=1}^p (a_i + 1)$ vertices and having minimum degree at least $\\sum_{i=1}^p a_i$.<\/jats:p>","DOI":"10.37236\/586","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:48:04Z","timestamp":1578714484000},"source":"Crossref","is-referenced-by-count":0,"title":["Embedding a Forest in a Graph"],"prefix":"10.37236","volume":"18","author":[{"given":"Mark K.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malik","family":"Magdon-Ismail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2011,4,29]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p99\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p99\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:12:40Z","timestamp":1579302760000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,29]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/586","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2011,4,29]]},"article-number":"P99"}}