The partition of a uniform hypergraph into pairs of dependent hyperedges

It is known that the edge set of a connected graph of even size has a partition into pairs of incident edges. Based on a matching theorem of D.P. Summer we extend this result to uniform hypergraphs. The obtained partition results are tight; our hypergraph constructions also show that D.P. Sumnerʹs matching theorem cannot be strengthened.