Pages that link to "Item:Q1356038"
From MaRDI portal
The following pages link to Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038):
Displaying 18 items.
- A stability theorem on fractional covering of triangles by edges (Q412272) (← links)
- Fractional covers and matchings in families of weighted \(d\)-intervals (Q681591) (← links)
- On the fractional matching polytope of a hypergraph (Q684403) (← links)
- Hypergraph families with bounded edge cover or transversal number (Q790130) (← links)
- Optimal fractional matchings and covers in infinite hypergraphs: existence and duality (Q1187944) (← links)
- On the stochastic independence properties of hard-core distributions (Q1272181) (← links)
- Bounding the vertex cover number of a hypergraph (Q1323476) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- A generalisation of matching and colouring (Q1877669) (← links)
- Edge-covers in \(d\)-interval hypergraphs (Q2411826) (← links)
- Solution of two fractional packing problems of Lovász. (Reprint) (Q2497997) (← links)
- A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers (Q3323708) (← links)
- On Tensor Powers of Integer Programs (Q3989018) (← links)
- A linear programming perspective on the Frankl?R�dl?Pippenger theorem (Q4870539) (← links)
- On the Fractional Covering Number of Hypergraphs (Q5202214) (← links)
- An asymptotic bound for the strong chromatic number (Q5222554) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Some combinatorial algorithms on the edge cover number of \(k\)-regular connected hypergraphs (Q6636093) (← links)
