Paths in tournaments, a simple proof of Rosenfeld's Conjecture
Résumé
Rosenfeld Conjectured [7] 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.
Domaines
Combinatoire [math.CO]
Origine : Fichiers produits par l'(les) auteur(s)