Transversal Hamilton cycles in digraph collections
Abstract Given a collection $\mathcal{D} =\{D_1,D_2,\ldots ,D_m\}$ of digraphs on the common vertex set $V$ , an $m$ -edge digraph $H$ with vertices in $V$ is transversal in $\mathcal{D}$ if there exists a bijection $\varphi \,:\,E(H)\rightarrow [m]$ such that $e \in E(D_{\varphi (e)})$ for all $e\in E(H)$ . Ghouila-Houri proved that any $n$ -vertex digraph with minimum semi-degree at least $\frac {n}{2}$ contains a directed Hamilton cycle. In this paper, we provide a transversal generalisation of Ghouila-Houri’s theorem, thereby solving a problem proposed by Chakraborti, Kim, Lee, and Seo. Our proof utilises the absorption method for transversals, the regularity method for digraph collections, as well as the transversal blow-up lemma and the related machinery. As an application, when $n$ is sufficiently large, our result implies the transversal version of Dirac’s theorem, which was proved by Joos and Kim.
Authors
- Heng Li (ORCID: https://orcid.org/0000-0002-5026-2100)
- Guanghui Wang (ORCID: https://orcid.org/0000-0001-6213-0693)
- Y. Cheng (ORCID: https://orcid.org/0009-0005-2737-7523)
- Wanting Sun
Institutions
- Shandong University (CN)
- University of Oxford (GB)
Publication Details
- Journal
- Combinatorics Probability Computing
- Published
- 2026-03-27
- DOI
- https://doi.org/10.1017/s0963548326100388
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00