Pages that link to "Item:Q5469026"
From MaRDI portal
The following pages link to Matchings in hypergraphs of large minimum degree (Q5469026):
Displaying 50 items.
- 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)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- Perfect matchings in uniform hypergraphs with large minimum degree (Q850084) (← 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)
- 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)
- Covering and tiling hypergraphs with tight cycles (Q1689974) (← links)
- \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
- Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- Matching in 3-uniform hypergraphs (Q1999738) (← links)
- Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs (Q2023735) (← links)
- Tight bounds for powers of Hamilton cycles in tournaments (Q2101176) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Co-degrees resilience for perfect matchings in random hypergraphs (Q2294109) (← 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)
- 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)
- 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)
- Santa claus meets hypergraph matchings (Q3189065) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← 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)
- Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
- Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree (Q5046627) (← links)
- A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs (Q5135735) (← links)
- Matching criticality in intersecting hypergraphs (Q5236049) (← links)
- Near Perfect Matchings in<i>k</i>-Uniform Hypergraphs (Q5364253) (← links)
- Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (Q5419939) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)