Hamiltonicity in infinite tournaments
Abstract
We prove that for all countable tournaments D the recently discovered compactification |D| by their ends and limit edges contains a topological Hamilton path: a topological arc that contains every vertex. If D is strongly connected, then |D| contains a topological Hamilton circle. These results extend well-known theorems about finite tournaments, which we show do not extend to the infinite in a purely combinatorial setting.
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.