Oriented Hamiltonian Paths in Tournaments: Stability under Arc Deletion
Combinatorics
2025-12-11 v1
Abstract
Havet and Thomass\'{e} proved that every tournament of order contains every oriented Hamiltonian path, which was conjectured by Rosenfeld. Recently, it was shown that in any tournament of order , there exists an arc such that contains any oriented Hamiltonian path. A natural extension of this problem is to study the stability of this property under arbitrary arc deletion. In this paper, we prove that every arc in a tournament of order satisfies that contains every oriented Hamiltonian path, except for some explicitly described exceptions.
Keywords
Cite
@article{arxiv.2512.09332,
title = {Oriented Hamiltonian Paths in Tournaments: Stability under Arc Deletion},
author = {Mahabba El Sahili and Ayman El Zein},
journal= {arXiv preprint arXiv:2512.09332},
year = {2025}
}