Rainbow Hamilton cycle in hypergraph system

MaRDI QIDQ6425019zbMATH OpenFDO

Authors Yu Cong Tang, Bin Wang, Guanghui Wang, Guiying Yan

Publication date 31 January 2023

Abstract: In this paper, we develop a new rainbow Hamilton framework, which is of independent interest, settling the problem proposed by Gupta, Hamann, M"{u}yesser, Parczyk, and Sgueglia when $k=3$, and draw the general conclusion for any $kgeq3$ as follows. A $k$-graph system $extbfH={H_i}_{iin[n]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$, moreover, a $k$-graph $H$ on $V$ is rainbow if $$ and $|E(H)capE(H_i)|leq1$ for $iin[n]$. We show that given $gamma>0$, sufficiently large $n$ and an $n$-vertex $k$-graph system $extbfH={H_i}_{iin[n]}$ , if $$ for $iin[n]$ where $kgeq3$, then there exists a rainbow tight Hamilton cycle. This result implies the conclusion in a single graph, which was proved by Lang and Sanhueza-Matamala [$J.Lond.Math.Soc.,2022$], Polcyn, Reiher, R"{o}dl and Sch"{u}lke [$J.Combin.TheorySer.B,2021$] independently.

This page was built for publication: Rainbow Hamilton cycle in hypergraph system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425019)