Counting Hamiltonian Paths in Transitive Tournaments

Zeina Ghazo Hanna, Amine El Sahili · arXiv (Cornell University) · 2022

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.

Read the paper · More papers on PaperTik