Note on Long Directed Cycles in Eulerian Digraphs
arXiv:2510.26426
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
4 pages