quality:corruption
Special cases

An asymptotic formula for the number of Eulerian circuits in the complete graphs was determined by McKay and Robinson (1995):

A similar formula was later obtained by M.I. Isaev (2009) for complete bipartite graphs: