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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Transversal Hamilton cycles in digraph collections

Heng Li, Guanghui Wang, Y. Cheng, Wanting Sun
Combinatorics Probability Computing
Graph theory and applications
article

Transversal Hamilton cycles in digraph collections

Heng Li, Guanghui Wang, Y. Cheng, Wanting Sun
article en

Abstract

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.

Combinatorics Probability Computing
Shandong University (CN), University of Oxford (GB)
Openalex Percentile: Top 4%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.