{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:09:11Z","timestamp":1768450151701,"version":"3.49.0"},"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>Let $c\\in (0, 1]$ be a real number and let $n$ be a sufficiently large integer.\u00a0We prove that every $n$-vertex $c n$-regular graph $G$ contains a collection of $\\lfloor 1\/c \\rfloor$ paths whose union covers all but at most $o(n)$ vertices of $G$.\u00a0The constant $\\lfloor 1\/c \\rfloor$ is best possible when $1\/c\\notin \\mathbb{N}$ and off by $1$ otherwise.\u00a0Moreover, if in addition $G$ is bipartite, then the number of paths can be reduced to $\\lfloor 1\/(2c) \\rfloor$, which is best possible.<\/jats:p>","DOI":"10.37236\/7109","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T10:34:12Z","timestamp":1578652452000},"source":"Crossref","is-referenced-by-count":3,"title":["On Vertex-Disjoint Paths in Regular Graphs"],"prefix":"10.37236","volume":"25","author":[{"given":"Jie","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2018,4,27]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p12\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p12\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:34:31Z","timestamp":1579217671000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i2p12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,27]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/7109","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,27]]},"article-number":"P2.12"}}