vix.ing · top · new · best · stats

Counting Hamiltonian Paths in Transitive Tournaments

2022/07/23 by Zeina Ghazo Hanna, Hanna, Zeina Ghazo, Amine El Sahili +1
Computer Science · Economics, Econometrics and Finance · Mathematics · #Advanced Database Systems and Queries #Artificial Intelligence in Games #Combinatorics (math.CO) #FOS: Mathematics #Game Theory and Voting Systems #math.CO

paper · pdf · doi:10.48550/arxiv.2207.11510

arxiv created 2022/07/23 · openalex publication_date 2022/07/23 · arxiv updated 2022/07/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related