Pages that link to "Item:Q641543"
From MaRDI portal
The following pages link to Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543):
Displaying 38 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)
- On extremal hypergraphs for Hamiltonian cycles (Q412248) (← 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)
- On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← 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)
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs (Q2258905) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
- Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
- (Q2857450) (← links)
- On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size (Q2883857) (← 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)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← 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)
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs (Q6081575) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)
