Pages that link to "Item:Q5495801"
From MaRDI portal
The following pages link to Polynomial-time perfect matchings in dense hypergraphs (Q5495801):
Displaying 8 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q2857424) (← links)
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
- The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)