Pages that link to "Item:Q3651570"
From MaRDI portal
The following pages link to The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree (Q3651570):
Displaying 4 items.
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
