Factoring complete graphs and hypergraphs into factors with few maximal cliques

Paul Erdős, David P. Galvin, Fred Galvin +1

For integers $r,t\ge 2$ and $n\ge 1$ let $f_r(t,n)$ be the minimum, over all factorizations of the complete $r$-uniform hypergraph of order $n$ into $t$ factors $H_1,\dots ,H_t$, of…