Some results and problems on clique coverings of hypergraphs
| Autor: | Rödl, Vojtech, Sales, Marcelo |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | 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. Comment: 14 pages |
| Databáze: | arXiv |
| Externí odkaz: |
|