A $k$-graph system $\textbf{H}=\{H_i\}_{i\in[m]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$ and a $k$-graph $H$ on $V$ is said to be $\textbf{H}$-transversal provided that there exists an injection $φ: E(H)\rightarrow [m]$ such that $e\in E(H_{φ(e)})$ for all $e\in E(H)$. We show that given $k\geq3, γ>0$, sufficiently large $n$ and an $n$-vertex $k$-graph system $\textbf{H}=\{H_i\}_{i\in[n]}$, if $δ_{k-1}(H_i)\geq(1/2+γ)n$ for each $i\in[n]$, then there exists an $\textbf{H}$-transversal tight Hamilton cycle. This extends the result of Rödl, Ruciński and Szemerédi [Combinatorica, 2008] on single $k$-graphs.

20 pages,5 figures