On the Fractional Covering Number of Hypergraphs
From MaRDI portal
Publication:5202214
DOI10.1137/0401005zbMath0724.05054OpenAlexW2168008629MaRDI QIDQ5202214
Michael R. Garey, Zoltan Fueredi, Ronald L. Graham, Fan R. K. Chung
Publication date: 1988
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0401005
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, Universal maximal packing functions of graphs, Maximal irredundant functions, Fractional covers of hypergraphs with bounded multi-intersection, Covering the complete graph by partitions, Sequential legislative lobbying, Indecomposable regular graphs and hypergraphs, Unnamed Item, Linear kernelizations for restricted 3-Hitting Set problems, Matchings and covers in hypergraphs, On the computational complexity of upper fractional domination, Covering pairs by \(q^ 2+q+1\) sets, Intersecting designs from linear programming and graphs of diameter two
