Pages that link to "Item:Q1115456"
From MaRDI portal
The following pages link to Fractional matchings and covers in infinite hypergraphs (Q1115456):
Displaying 13 items.
- On the computational complexity of upper fractional domination (Q753848) (← links)
- LP duality in infinite hypergraphs (Q803165) (← links)
- Optimal fractional matchings and covers in infinite hypergraphs: existence and duality (Q1187944) (← links)
- Infinite matching theory (Q1191911) (← links)
- On the strength of König's duality theorem for infinite bipartite graphs (Q1193566) (← links)
- Strong LP duality in weighted infinite bipartite graphs (Q1332441) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Maximal irredundant functions (Q1923617) (← links)
- Solution of two fractional packing problems of Lovász. (Reprint) (Q2497997) (← links)
- A linear programming perspective on the Frankl?R�dl?Pippenger theorem (Q4870539) (← links)
- On the Fractional Covering Number of Hypergraphs (Q5202214) (← links)