Paths in tournaments a simple proof of Rosenfeld's Conjecture

2020/11/29 by Charbel Bou Hanna, Hanna, Charbel Bou · 1 citation
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.2011.14394

arxiv created 2020/11/29 · arxiv updated 2020/12/01

Abstract

Rosenfeld Conjectured in 1972 that there exists an integer K ≥ 8 such that any tournament of order n ≥ K contains any Hamiltonian oriented path. In 2000, Havet and Thomassé proved this conjecture for any tournament with exactly 3 exceptions. We give a simplified proof of this fact.

Cited by

• Oriented Hamiltonian Paths in Tournaments: Stability under Arc Deletion

Related

• About the number of oriented Hamiltonian paths and cycles in tournaments
• Oriented Hamiltonian Cycles in Tournaments: a Proof of Rosenfeld's Conjecture
• Oriented Hamiltonian Paths in Tournaments: Stability under Arc Deletion
• Counting Hamiltonian Paths in Transitive Tournaments
• The Tournament Theorem of Rédei revisited