Pages that link to "Item:Q475264"
From MaRDI portal
The following pages link to Polynomial-time perfect matchings in dense hypergraphs (Q475264):
Displaying 10 items.
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Cyclic triangle factors in regular tournaments (Q2335694) (← 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)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)
