Pages that link to "Item:Q1014811"

The following pages link to Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree (Q1014811):

Displaying 45 items.

• Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
• Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← 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)
• Note on matchings in 3-partite 3-uniform hypergraphs (Q512618) (← links)
• Forbidding Hamilton cycles in uniform hypergraphs (Q530769) (← links)
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs (Q544011) (← links)
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
• Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
• Perfect matchings in 4-uniform hypergraphs (Q896007) (← 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)
• A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs (Q2092337) (← 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)
• \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
• Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
• Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
• (Q2857424) (← links)
• (Q2857450) (← links)
• Tiling 3-Uniform Hypergraphs With K43−2e (Q2874094) (← links)
• Permanents of multidimensional matrices: Properties and applications (Q2959191) (← links)
• Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
• The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634) (← 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)
• d-matching in k-uniform hypergraphs (Q4597954) (← links)
• Almost Perfect Matchings in $k$-Partite $k$-Graphs (Q4605443) (← links)
• On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
• Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q5216177) (← 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)
• Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (Q5419939) (← links)
• A geometric theory for hypergraph matching (Q5497101) (← links)
• Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)
• A note on color-bias perfect matchings in hypergraphs (Q6622736) (← links)