Pages that link to "Item:Q2284737"

The following pages link to The complexity of perfect matchings and packings in dense hypergraphs (Q2284737):

Displaying 21 items.

• Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
• Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
• Efficient subgraphs packing (Q1321999) (← links)
• The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree (Q1933645) (← links)
• Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
• Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
• The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (Q2883612) (← links)
• Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
• (Q3139770) (← links)
• The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249) (← links)
• Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
• On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
• Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
• Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
• Perfect Packings in Quasirandom Hypergraphs II (Q5366906) (← links)
• Minimum Codegree Threshold for<i>C</i>₆³-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)
• Polynomial-time perfect matchings in dense hypergraphs (Q5495801) (← links)
• Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654) (← links)
• Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu (Q6050000) (← links)
• F$F$‐factors in Quasi‐random Hypergraphs (Q6134524) (← links)
• Cycle-factors in oriented graphs (Q6565819) (← links)