Pages that link to "Item:Q2349181"

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

Displayed 36 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)
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) ‎ (← links)
• Forbidding Hamilton cycles in uniform hypergraphs (Q530769) ‎ (← links)
• Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) ‎ (← links)
• A note on perfect matchings in uniform hypergraphs (Q907268) ‎ (← 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)
• Rainbow matchings for 3-uniform hypergraphs (Q2040498) ‎ (← links)
• Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs (Q2072182) ‎ (← links)
• A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs (Q2092337) ‎ (← links)
• A note on exact minimum degree threshold for fractional perfect matchings (Q2124789) ‎ (← 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)
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) ‎ (← links)
• Fractional and integer matchings in uniform hypergraphs (Q2637239) ‎ (← 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)
• Almost Perfect Matchings in $k$-Partite $k$-Graphs (Q4605443) ‎ (← links)
• On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) ‎ (← links)
• Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) ‎ (← links)
• Matching of Given Sizes in Hypergraphs (Q5043636) ‎ (← links)
• Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) ‎ (← links)
• Minimum Vertex Degree Threshold for ‐tiling* (Q5265336) ‎ (← links)
• Near Perfect Matchings in<i>k</i>-Uniform Hypergraphs (Q5364253) ‎ (← links)
• Perfect Packings in Quasirandom Hypergraphs II (Q5366906) ‎ (← 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)
• Co-degree threshold for rainbow perfect matchings in uniform hypergraphs (Q6051049) ‎ (← links)
• Improved bound on vertex degree version of Erdős matching conjecture (Q6081573) ‎ (← links)