Pages that link to "Item:Q2957178"
From MaRDI portal
The following pages link to Recent advances on Dirac-type problems for hypergraphs (Q2957178):
Displayed 47 items.
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
- Hamiltonicity in randomly perturbed hypergraphs (Q777475) (← links)
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs (Q1627213) (← 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)
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (Q1689892) (← 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)
- Matching in 3-uniform hypergraphs (Q1999738) (← 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)
- Hamiltonicity in cherry-quasirandom 3-graphs (Q2122670) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (Q2220980) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Rainbow factors in hypergraphs (Q2299634) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107) (← links)
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph (Q2400547) (← links)
- Euler tours in hypergraphs (Q2658380) (← links)
- Properly colored Hamilton cycles in Dirac-type hypergraphs (Q2692184) (← links)
- Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
- Codegree Thresholds for Covering 3-Uniform Hypergraphs (Q2826217) (← links)
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← links)
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs (Q4993132) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
- Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
- A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs (Q5071104) (← links)
- Longest Paths in Random Hypergraphs (Q5163510) (← links)
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version (Q5371029) (← links)
- Exact Minimum Codegree Threshold for <i>K</i><sup>−</sup><sub>4</sub>-Factors (Q5373833) (← links)
- Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu (Q6050000) (← links)
- Factors in randomly perturbed hypergraphs (Q6074679) (← links)
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q6076728) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Minimum degree conditions for tight Hamilton cycles (Q6133938) (← links)