# Node disjoint circuits in Eulerian digraphs

Recently Wolfgang Mader [1] showed that the answer to the question is negative for any $k \geq 8$. He also proved that the answer is positive for k=3, and for any k in vertex-transitive digraphs.