arXiv Analytics

Sign in

arXiv:2101.05264 [math.CO]AbstractReferencesReviewsResources

Hamiltonicity in infinite tournaments

Ruben Melcher

Published 2021-01-13Version 1

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.

Related articles: Most relevant | Search more
arXiv:1208.2164 [math.CO] (Published 2012-08-10)
On the Meyniel condition for hamiltonicity in bipartite digraphs
arXiv:1512.00480 [math.CO] (Published 2015-12-01)
A degree sum condition for hamiltonicity in balanced bipartite digraphs
arXiv:2007.14502 [math.CO] (Published 2020-07-28)
A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs