Pages that link to "Item:Q965258"
From MaRDI portal
The following pages link to Dirac-type results for loose Hamilton cycles in uniform hypergraphs (Q965258):
Displayed 37 items.
- Bounds on the number of edges in hypertrees (Q279202) (← links)
- On extremal hypergraphs for Hamiltonian cycles (Q412248) (← links)
- Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version (Q510620) (← links)
- On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← links)
- An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs (Q526237) (← links)
- Forbidding Hamilton cycles in uniform hypergraphs (Q530769) (← links)
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs (Q544011) (← links)
- Loose Hamilton cycles in hypergraphs (Q629193) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- Hamiltonicity in randomly perturbed hypergraphs (Q777475) (← links)
- Hamilton \(\ell \)-cycles in uniform hypergraphs (Q986125) (← links)
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs (Q1627213) (← links)
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (Q1689892) (← links)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs (Q2072182) (← links)
- Hamiltonian paths and cycles in some 4-uniform hypergraphs (Q2157837) (← links)
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs (Q2258905) (← links)
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) (← links)
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph (Q2400547) (← links)
- Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
- Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
- Properly colored Hamilton cycles in Dirac-type hypergraphs (Q2692184) (← links)
- Hamilton cycles in quasirandom hypergraphs (Q2820275) (← links)
- Packing tight Hamilton cycles in 3-uniform hypergraphs (Q2884005) (← links)
- Packing hamilton cycles in random and pseudo-random hypergraphs (Q2909240) (← links)
- A hypergraph blow-up lemma (Q3094607) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs (Q4993132) (← links)
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q5216177) (← links)
- Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
- Minimum Codegree Threshold for<i>C</i><sub>6</sub><sup>3</sup>-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version (Q5371029) (← links)
- Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs (Q6074706) (← links)
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q6076728) (← links)
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs (Q6081575) (← links)