Paths in tournaments, a simple proof of Rosenfeld's Conjecture - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

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

(1)
1

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.
Fichier principal
Vignette du fichier
Thesis.pdf (139.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03029968 , version 1 (29-11-2020)

Identifiers

  • HAL Id : hal-03029968 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More