Pages that link to "Item:Q2975787"

The following pages link to Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787):

Displaying 18 items.

• Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
• Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
• Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
• The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
• Cyclic triangle factors in regular tournaments (Q2335694) (← links)
• Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← 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)
• Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
• Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
• Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592) (← links)
• Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654) (← links)
• Graph Tilings in Incompatibility Systems (Q6046822) (← 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)
• A Ramsey–Turán theory for tilings in graphs (Q6185051) (← links)