  Long Paths and Cycles in eulerian digraphs have gotten a lot of attention
recently. In this short note, we show how to use methods from Knierim, Larcher,
Martinsson, Noever (2021) to find long paths in Eulerian digraphs, improving
the recent result of $\Omega(d^{1/2+1/40})$ by Janzer, Sudakov and Tomon.
