Counting Hamiltonian Paths in Transitive Tournaments
Combinatorics
2022-07-26 v1
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.
Keywords
Cite
@article{arxiv.2207.11510,
title = {Counting Hamiltonian Paths in Transitive Tournaments},
author = {Zeina Ghazo Hanna and Amine El Sahili},
journal= {arXiv preprint arXiv:2207.11510},
year = {2022}
}