English

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 n8n\geq 8 contains every oriented Hamiltonian path, which was conjectured by Rosenfeld. Recently, it was shown that in any tournament TT of order n8n\geq 8, there exists an arc ee such that TeT-e 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 ee in a tournament TT of order n8n\geq 8 satisfies that TeT-e 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}
}
R2 v1 2026-07-01T08:18:22.460Z