Pages that link to "Item:Q3652249"
From MaRDI portal
The following pages link to The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249):
Displaying 10 items.
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree (Q1933645) (← links)
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach (Q2012539) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q5495801) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- Perfect matching in bipartite hypergraphs subject to a demand graph (Q6099389) (← links)