Pages that link to "Item:Q439060"

The following pages link to Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060):

Displaying 11 items.

• Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
• Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
• On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504) (← links)
• Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
• Perfect matchings in 4-uniform hypergraphs (Q896007) (← links)
• Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs (Q1633862) (← links)
• \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
• On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
• Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)