Pages that link to "Item:Q1933645"
From MaRDI portal
The following pages link to The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree (Q1933645):
Displaying 5 items.
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
- (Q3139770) (← links)