Oriented Hamiltonian Paths in Tournaments: Stability under Arc Deletion

Abstract

Havet and Thomass\'e proved that every tournament of order n≥ 8 contains every oriented Hamiltonian path, which was conjectured by Rosenfeld. Recently, it was shown that in any tournament T of order n≥ 8, there exists an arc e such that T-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 e in a tournament T of order n≥ 8 satisfies that T-e contains every oriented Hamiltonian path, except for some explicitly described exceptions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…