Pages that link to "Item:Q3069732"
From MaRDI portal
The following pages link to COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY (Q3069732):
Displaying 9 items.
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- (Q2857450) (← links)
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
- The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)