The size of connected hypergraphs with prescribed covering number
Abstract
We determine the minimum number of edges in a connected r-graph with covering number α and characterize the extremal r-graphs, when α≡1 (mod r-1). © 1981 Academic Press, Inc.
Publication Title
Journal of Combinatorial Theory, Series B
Recommended Citation
Bollobás, B., & Thomassen, C. (1981). The size of connected hypergraphs with prescribed covering number. Journal of Combinatorial Theory, Series B, 31 (2), 150-155. https://doi.org/10.1016/S0095-8956(81)80020-2
COinS
