First, we show that the determinant of a given matrix can be expanded by its principal minors together with a set of arbitrary parameters. The enumeration of Hamiltonian cycles and paths in a graph is ...

We prove that a properly edge-coloured complete graph Kn has a Hamilton circuit with edges of at least n - √2n distinct colours. This is proved with a method inspired by work on long partial ...