Pages that link to "Item:Q907268"

The following pages link to A note on perfect matchings in uniform hypergraphs (Q907268):

Displaying 17 items.

• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
• Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs (Q1633862) (← links)
• Vertex degree sums for perfect matchings in 3-uniform hypergraphs (Q1671670) (← links)
• \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
• Matching in 3-uniform hypergraphs (Q1999738) (← links)
• Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs (Q2023735) (← links)
• Maximum size of a graph with given fractional matching number (Q2088698) (← links)
• The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
• The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
• Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
• Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← 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)
• Minimum Codegree Threshold for<i>C</i>₆³-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)
• Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)
• A note on color-bias perfect matchings in hypergraphs (Q6622736) (← links)