Pages that link to "Item:Q2848550"

The following pages link to Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree (Q2848550):

Displaying 48 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)
• 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)
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
• On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← 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)
• Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs (Q2023735) (← links)
• Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
• Stability on matchings in 3-uniform hypergraphs (Q2124791) (← 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)
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) (← links)
• Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
• Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
• (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)
• d-matching in k-uniform hypergraphs (Q4597954) (← links)
• On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
• Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
• Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
• A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs (Q5071104) (← 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)
• A geometric theory for hypergraph matching (Q5497101) (← links)
• Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
• Co-degree threshold for rainbow perfect matchings in uniform hypergraphs (Q6051049) (← links)
• Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
• Improved bound on vertex degree version of Erdős matching conjecture (Q6081573) (← links)
• Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)