Transversal Hamilton cycles in digraph collections

Read full text
Authors: Y. Cheng, H. Li, Wanting Sun, Guanghui Wang
Cited by: 0
References: 21

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.

Fields of Study & Subjects

Advanced Graph Theory Research DNA and Biological Computing Graph theory and applications

Publication details

Journal / source
Combinatorics Probability Computing
Publisher
Cambridge University Press (CUP)
Volume
35
Issue
5
Pages
1–57
Publication date
27 March 2026
Language
EN