Counting Hamiltonian Paths in Transitive Tournaments
arXiv:2207.11510
Abstract
We construct a combinatorial function F which computes the number of oriented Hamiltonian paths of any given type, in a transitive tournament. We also study many properties of F that arise, and reach some observations.