Long cycles in vertex transitive digraphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915803990851584 |
|---|---|
| author | Bucić, Matija Hendrey, Kevin Mohar, Bojan Steiner, Raphael Yepremyan, Liana |
| author_facet | Bucić, Matija Hendrey, Kevin Mohar, Bojan Steiner, Raphael Yepremyan, Liana |
| contents | One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this form, it was first written down by Thomassen in 1978, inspired by a closely related conjecture due to Lovász from 1969. It has been attributed to several other authors in a survey on the topic by Witte and Gallian in 1984.
The analogous question for vertex transitive digraphs has an even longer history, having been first considered by Rankin in 1946. It is arguably more natural from the group-theoretic perspective underlying this problem in both settings. Trotter and Erdős proved in 1978 that there are infinitely many connected vertex transitive digraphs which are not Hamiltonian. This left open the very natural question of how long a directed cycle one can guarantee in a connected vertex transitive digraph on $n$ vertices.
In 1981, Alspach asked if the maximum perimeter gap (the gap between the circumference and the order of the digraph) is a growing function in $n$. We answer this question in the affirmative, showing that it grows at least as fast as $(1-o(1)) \ln n$. On the other hand, we prove that one can always find a directed cycle of length at least $Ω(n^{1/3})$, establishing the first lower bound growing with $n$, providing a directed analogue of a famous result of Babai from 1979 in the undirected setting. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_16333 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Long cycles in vertex transitive digraphs Bucić, Matija Hendrey, Kevin Mohar, Bojan Steiner, Raphael Yepremyan, Liana Combinatorics 05C20, 05C38, 05C25, 05C45, 05C48, 05E18 One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this form, it was first written down by Thomassen in 1978, inspired by a closely related conjecture due to Lovász from 1969. It has been attributed to several other authors in a survey on the topic by Witte and Gallian in 1984. The analogous question for vertex transitive digraphs has an even longer history, having been first considered by Rankin in 1946. It is arguably more natural from the group-theoretic perspective underlying this problem in both settings. Trotter and Erdős proved in 1978 that there are infinitely many connected vertex transitive digraphs which are not Hamiltonian. This left open the very natural question of how long a directed cycle one can guarantee in a connected vertex transitive digraph on $n$ vertices. In 1981, Alspach asked if the maximum perimeter gap (the gap between the circumference and the order of the digraph) is a growing function in $n$. We answer this question in the affirmative, showing that it grows at least as fast as $(1-o(1)) \ln n$. On the other hand, we prove that one can always find a directed cycle of length at least $Ω(n^{1/3})$, establishing the first lower bound growing with $n$, providing a directed analogue of a famous result of Babai from 1979 in the undirected setting. |
| title | Long cycles in vertex transitive digraphs |
| topic | Combinatorics 05C20, 05C38, 05C25, 05C45, 05C48, 05E18 |
| url | https://arxiv.org/abs/2602.16333 |