Paths in tournaments a simple proof of Rosenfeld's Conjecture
Combinatorics
2020-12-01 v1
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\'e proved this conjecture for any tournament with exactly 3 exceptions. We give a simplified proof of this fact.
Cite
@article{arxiv.2011.14394,
title = {Paths in tournaments a simple proof of Rosenfeld's Conjecture},
author = {Charbel Bou Hanna},
journal= {arXiv preprint arXiv:2011.14394},
year = {2020}
}