Pages that link to "Item:Q439060"
From MaRDI portal
The following pages link to Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060):
Displaying 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)
- On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504) (← 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)
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs (Q2032885) (← 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 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)
- 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)
- 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)
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem (Q4959763) (← links)
- Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
- On Directed Versions of the Hajnal–Szemerédi Theorem (Q5364261) (← 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)
- 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)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)
