Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Paths in tournaments, a simple proof of Rosenfeld's Conjecture

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03029968
Contributor : Charbel Bou Hanna Connect in order to contact the contributor
Submitted on : Sunday, November 29, 2020 - 5:25:22 PM
Last modification on : Wednesday, November 3, 2021 - 6:05:21 AM

Files

Thesis.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03029968, version 1

Collections

Citation

Charbel Bou Hanna. Paths in tournaments, a simple proof of Rosenfeld's Conjecture. 2020. ⟨hal-03029968⟩

Share

Metrics

Les métriques sont temporairement indisponibles