English

Hamiltonicity in infinite tournaments

Combinatorics 2021-01-14 v1

Abstract

We prove that for all countable tournaments DD the recently discovered compactification D|D| by their ends and limit edges contains a topological Hamilton path: a topological arc that contains every vertex. If DD is strongly connected, then D|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.

Keywords

Cite

@article{arxiv.2101.05264,
  title  = {Hamiltonicity in infinite tournaments},
  author = {Ruben Melcher},
  journal= {arXiv preprint arXiv:2101.05264},
  year   = {2021}
}

Comments

13 pages, 4 figures

R2 v1 2026-06-23T22:08:15.402Z