Optimal and Efficient Partite Decompositions of Hypergraphs

Andrew Krapivin, Benjamin Przybocki, Nicolás Sanhueza-Matamala +1

We study the problem of partitioning the edges of a $d$-uniform hypergraph $H$ into a family $F$ of complete $d$-partite hypergraphs ($d$-cliques). We show that there is a partitio…