2 papers
math.CO2026
Enumerating Hamiltonian Paths and Cycles
Harry Hylock, Karl Michael Schmidt, Matthew C. Lettington
We prove counting formulae for the number of directed Hamiltonian paths and directed Hamiltonian cycles in any complete multipartite graph. The method is based on a collapsing tech…
math.CO2026
On c-polynomial factorisations
Harry G. Hylock, Matthew C. Lettington, Karl Michael Schmidt
c-Polynomials are polynomials whose (non-zero) coefficients are all equal to 1. Taking a theorem by Carlitz and Moser as a motivation, we prove a structure theorem for the factoris…