Cycle decompositions in k-uniform hypergraphs

We show that k-uniform hypergraphs on n vertices whose codegree is at least (2/3+o(1))n can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler tours as well. In passing, we also investigate decompositions into tight paths. In addition, we also prove an alternative condition for building absorbers for edge-decompositions of arbitrary k-uniform hypergraphs, which should be of independent interest.