The number of Hamiltonian circuits in large, heavily edged graphs
J. Sheehan, Elizabeth Mary Wright · Glasgow Mathematical Journal · 1977
G is a graph on n nodes with q edges, without loops or multiple edges. We write α = q/n and β for the maximum degree of any node of G. We write and H for the number of Hamiltonian circuits (H.c.) in the complement of G, or, what is the same thing, the number of those H.c. in the complete graph Kn which have no edge in common with G. Our object here is to prove the following theorem.