Some results and problems on clique coverings of hypergraphs
Vojtech Rödl, Marcelo Sales·2022-06-04·via math.CO updates on arXiv.org
For a $k$-uniform hypergraph $F$ we consider the parameter $Θ(F)$, the minimum size of a clique cover of the of $F$. We derive bounds on $Θ(F)$ for $F$ belonging to various classes of hypergraphs.