For a ‐uniform hypergraph we consider the parameter , the minimum size of a clique cover of the edge set of . We derive bounds on for belonging to various classes of hypergraphs.
No takes yet. Share an insight, caveat, or question.
Rödl et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: