{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:47Z","timestamp":1753893827699,"version":"3.41.2"},"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>Long paths and cycles in Eulerian digraphs have received a lot of attention recently. In this short note, we show how to use methods from [Knierim, Larcher, Martinsson, Noever, JCTB 148:125--148] to find paths of length $d\/(\\log d+1)$ in Eulerian digraphs with average degree $d$, improving\u00a0 the recent result of $\\Omega(d^{1\/2+1\/40})$. Our result is optimal up to at most a logarithmic factor.\r\n\u00a0<\/jats:p>","DOI":"10.37236\/10297","type":"journal-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T01:56:14Z","timestamp":1625018174000},"source":"Crossref","is-referenced-by-count":0,"title":["Note on Long Paths in Eulerian Digraphs"],"prefix":"10.37236","volume":"28","author":[{"given":"Charlotte","family":"Knierim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Larcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Martinsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2021,6,18]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i2p37\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i2p37\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T01:56:15Z","timestamp":1625018175000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v28i2p37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,18]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,4,9]]}},"URL":"https:\/\/doi.org\/10.37236\/10297","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2021,6,18]]},"article-number":"P2.37"}}