Note on Long Directed Cycles in Eulerian Digraphs
Abstract
Huang, Ma, Shapira, Sudakov and Yuster (Comb. Prob. Comput. 2013) proved that every Eulerian digraph of average out-degree d has a directed cycle of length at least d. We improve the lower bound from d to 2d-3/2.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.