Pages that link to "Item:Q3563938"
From MaRDI portal
The following pages link to On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree (Q3563938):
Displayed 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)
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations (Q414653) (← 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)
- 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)
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree (Q1014811) (← 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)
- Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909) (← links)
- \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
- On multipartite Hajnal-Szemerédi theorems (Q1945958) (← links)
- Matching in 3-uniform hypergraphs (Q1999738) (← links)
- Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs (Q2023735) (← links)
- From one to many rainbow Hamiltonian cycles (Q2102759) (← links)
- Stability on matchings in 3-uniform hypergraphs (Q2124791) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Degree versions of theorems on intersecting families via stability (Q2326331) (← 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)
- Triangle factors of graphs without large independent sets and of weighted graphs (Q2953695) (← links)
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY (Q3069732) (← 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)
- Towards a Weighted Version of the Hajnal–Szemerédi Theorem (Q4921565) (← links)
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem (Q4959763) (← links)
- Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)