arXiv:2510.26426·math.CO·October 31, 2025
Note on Long Directed Cycles in Eulerian Digraphs
Jiangdong Ai, Gregory Gutin, Fankang He, Anders Yeo
TL;DR
None
Contribution
None
Abstract
Huang, Ma, Shapira, Sudakov and Yuster (Comb. Prob. Comput. 2013) proved that every Eulerian digraph of average out-degree has a directed cycle of length at least We improve the lower bound from to
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.