The following pages link to (Q4200095):
Displayed 29 items.
- On extremal hypergraphs for Hamiltonian cycles (Q412248) (← links)
- A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs (Q510575) (← links)
- On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← links)
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs (Q544011) (← links)
- Loose Hamilton cycles in hypergraphs (Q629193) (← links)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- Berge cycles in non-uniform hypergraphs (Q783055) (← links)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609) (← links)
- Hamilton-chain saturated hypergraphs (Q966015) (← links)
- Hamilton \(\ell \)-cycles in uniform hypergraphs (Q986125) (← links)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs (Q2032885) (← links)
- Spanning surfaces in \(3\)-graphs (Q2119367) (← links)
- Hamiltonian paths and cycles in some 4-uniform hypergraphs (Q2157837) (← links)
- A Dirac-type theorem for Berge cycles in random hypergraphs (Q2194091) (← links)
- Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles (Q2452426) (← links)
- Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs (Q2656703) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length (Q3298115) (← links)
- (Q4616112) (← links)
- (Q5000290) (← links)
- Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs (Q5028355) (← links)
- (Q5060438) (← links)
- (Q5869462) (← links)
- Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
- The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs (Q6056724) (← links)
- Minimum degree ensuring that a hypergraph is Hamiltonian-connected (Q6080369) (← links)
- Minimum degree conditions for tight Hamilton cycles (Q6133938) (← links)