Year: 2024
Type: article
Abstract: 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.
Source: Journal of Graph Theory
DOI: 10.1002/jgt.23111
Authors: Vojtech Rödl, Marcelo Sales
Institutions: Emory University, University of California, Irvine
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4399596121
