Some results and problems on clique coverings of hypergraphs
classification
🧮 math.CO
keywords
cliquehypergraphsthetabelongingboundsclassesconsidercover
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.