Pages that link to "Item:Q850084"

The following pages link to Perfect matchings in uniform hypergraphs with large minimum degree (Q850084):

Displaying 50 items.

• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060) (← links)
• Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
• Forbidding Hamilton cycles in uniform hypergraphs (Q530769) (← links)
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609) (← links)
• Perfect matchings in 4-uniform hypergraphs (Q896007) (← links)
• A note on perfect matchings in uniform hypergraphs (Q907268) (← links)
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs (Q965258) (← links)
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree (Q1014811) (← links)
• Perfect matchings in large uniform hypergraphs with large minimum collective degree (Q1024365) (← links)
• Almost perfect matchings in random uniform hypergraphs (Q1363674) (← links)
• Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← 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)
• On the number of nearly perfect matchings in almost regular uniform hypergraphs (Q1817560) (← links)
• A condition for matchability in hypergraphs (Q1900519) (← links)
• The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree (Q1933645) (← links)
• Matchings in 3-uniform hypergraphs (Q1945999) (← links)
• \(K_r\)-factors in graphs with low independence number (Q1998757) (← links)
• Matching in 3-uniform hypergraphs (Q1999738) (← links)
• Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach (Q2012539) (← links)
• Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs (Q2023735) (← links)
• Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
• Maximum size of a graph with given fractional matching number (Q2088698) (← links)
• A note on exact minimum degree threshold for fractional perfect matchings (Q2124789) (← links)
• Dirac-type theorems in random hypergraphs (Q2131868) (← 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)
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II (Q2349181) (← links)
• Perfect fractional matchings in \(k\)-out hypergraphs (Q2409824) (← links)
• Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
• On a hypergraph matching problem (Q2494110) (← links)
• Perfect matchings in \(r\)-partite \(r\)-graphs (Q2519794) (← links)
• Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
• Co-degree density of hypergraphs (Q2642025) (← links)
• Asymptotics for Shamir's problem (Q2700633) (← links)
• Perfect matchings in 3-uniform hypergraphs with large vertex degree (Q2848550) (← links)
• Matchings in 3-uniform hypergraphs of large minimum vertex degree (Q2857450) (← 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 in <i>k</i>-Complexes (Q3382619) (← links)
• (Q3568712) (← links)
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484) (← links)
• d-matching in k-uniform hypergraphs (Q4597954) (← links)