About the number of oriented Hamiltonian paths and cycles in tournaments

2021/01/03 by Amine El Sahili, Sahili, Amine El, Zeina Ghazo Hanna +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.2101.00713

arxiv created 2021/01/03 · arxiv updated 2021/01/05

Abstract

We prove that a tournament and its complement contain the same number of oriented Hamiltonian paths (resp. cycles) of any given type, as a generalization of Rosenfeld's result proved for antidirected paths.

Related

• Paths in tournaments a simple proof of Rosenfeld's Conjecture
• Oriented Hamiltonian Cycles in Tournaments: a Proof of Rosenfeld's Conjecture
• Counting Hamiltonian Paths in Transitive Tournaments
• Oriented Hamiltonian Paths in Tournaments: Stability under Arc Deletion
• The Tournament Theorem of Rédei revisited