Some results and problems on clique coverings of hypergraphs

Abstract

For a $k$-uniform hypergraph $F$ we consider the parameter $\Theta (F)$, the minimum size of a clique cover of the of $F$. We derive bounds on $\Theta (F)$ for $F$ belonging to various classes of hypergraphs.

14 pages