Pages that link to "Item:Q426891"

The following pages link to Tight co-degree condition for perfect matchings in 4-graphs (Q426891):

Displaying 19 items.

• Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060) (← links)
• Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
• Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
• A note on perfect matchings in uniform hypergraphs (Q907268) (← links)
• The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) (← links)
• Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
• Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← links)
• Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
• Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
• Minimum Vertex Degree Threshold for ‐tiling* (Q5265336) (← links)
• Near Perfect Matchings in<i>k</i>-Uniform Hypergraphs (Q5364253) (← links)
• Minimum Codegree Threshold for<i>C</i>₆³-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)
• Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (Q5419939) (← links)
• A geometric theory for hypergraph matching (Q5497101) (← links)