{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:36:30Z","timestamp":1776116190903,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The Tur\u00e1n number of a graph $H$, $\\mathrm{ex}(n,H)$, is the maximum number of edges in a graph on $n$ vertices which does not have $H$ as a subgraph. We determine the Tur\u00e1n number and find the unique extremal graph for forests consisting of paths when $n$ is sufficiently large. This generalizes a result of Bushaw and Kettle [Combinatorics, Probability and Computing 20:837--853, 2011]. We also determine the Tur\u00e1n number and extremal graphs for forests consisting of stars of arbitrary order.<\/jats:p>","DOI":"10.37236\/3142","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:24:38Z","timestamp":1578705878000},"source":"Crossref","is-referenced-by-count":27,"title":["On the Tur\u00e1n Number of Forests"],"prefix":"10.37236","volume":"20","author":[{"given":"Hong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Lidicky","sequence":"additional","affiliation":[]},{"given":"Cory","family":"Palmer","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2013,6,30]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p62\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p62\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:16:53Z","timestamp":1579259813000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i2p62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,30]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,4,9]]}},"URL":"https:\/\/doi.org\/10.37236\/3142","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,30]]},"article-number":"P62"}}