A decomposition of complete bipartite 4-uniform hypergraphs K_4^{5,5} into loose cycles of length 5,10

Abstract

A k-uniform hypergraph H is a pair (V, ε), where V = {v 1 , v 2 , . . . , v n } is a set of n vertices and ε is a family of k-subset of V called hyperedges. We consider the problem of constructing a decompositions for complete bipartite uniform hypergraphs into loose cycle. Mathematics Subject Classification: 05C65