Cycle decompositions in $3$-uniform hypergraphs

Simón Piga, Nicolás Sanhueza-Matamala

We show that $3$-graphs on $n$ vertices whose codegree is at least $(2/3+o(1))n$ can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divis…