Pages that link to "Item:Q1024365"
From MaRDI portal
The following pages link to Perfect matchings in large uniform hypergraphs with large minimum collective degree (Q1024365):
Displaying 50 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)
- On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504) (← 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)
- 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)
- 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)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← 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)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- Transitive triangle tilings in oriented graphs (Q1989953) (← links)
- Matching in 3-uniform hypergraphs (Q1999738) (← links)
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs (Q2072182) (← links)
- Tight bounds for powers of Hamilton cycles in tournaments (Q2101176) (← links)
- From one to many rainbow Hamiltonian cycles (Q2102759) (← links)
- A note on exact minimum degree threshold for fractional perfect matchings (Q2124789) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices (Q2287773) (← 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)
- Codegree Thresholds for Covering 3-Uniform Hypergraphs (Q2826217) (← 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)
