Some results and problems on clique coverings of hypergraphs
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.