On the Fractional Covering Number of Hypergraphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7559412
- Fractional covers of hypergraphs with bounded multi-intersection
- Fractional v. integral covers in hypergraphs of bounded edge size
- A note on fractional covers of a graph
- Fractional matchings and covers in infinite hypergraphs
- scientific article; zbMATH DE number 5011088
- Fractional Vertex Covering Functions in Graphs
- On fractional domination numbers in graphs
- On covering numbers of regular hypergraphs
- Fractional matchings in hypergraphs
Cited in
(18)- Fractional matchings and covers in infinite hypergraphs
- Universal maximal packing functions of graphs
- Indecomposable regular graphs and hypergraphs
- Intersecting designs from linear programming and graphs of diameter two
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Matchings and covers in hypergraphs
- Maximal irredundant functions
- Sequential legislative lobbying
- A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers
- scientific article; zbMATH DE number 5011088 (Why is no real title available?)
- scientific article; zbMATH DE number 7559412 (Why is no real title available?)
- Fractional covers of hypergraphs with bounded multi-intersection
- Optimal strategies in fractional games: vertex cover and domination
- On the computational complexity of upper fractional domination
- Covering pairs by q^ 2+q+1 sets
- Integer and fractional packings of hypergraphs
- Covering the complete graph by partitions
- Linear kernelizations for restricted 3-Hitting Set problems
This page was built for publication: On the Fractional Covering Number of Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202214)
