Answers are grounded in this paper and cite their sources.
Demonstrates the transversal Hamilton cycle in digraph collections, implying new results in graph theory.
Given a collection D =₁,D₂,… ,Dₘ\ of digraphs on the common vertex set V , an m -edge digraph H with vertices in V is transversal in D if there exists a bijection φ \,:\,E(H)→ [m] such that e ∈ E(Dφ (e)) for all e∈ E(H) . Ghouila-Houri proved that any n -vertex digraph with minimum semi-degree at least 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.
No takes yet. Share an insight, caveat, or question.
Cheng et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: