The following pages link to Hamiltonian chains in hypergraphs (Q4237729):
Displaying 46 items.
- Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
- Extremal \(k\)-edge-Hamiltonian hypergraphs (Q2476283) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- Constructions via Hamiltonian theorems (Q2576854) (← links)
- Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs (Q2656703) (← links)
- On tight 6-cycle decompositions of complete 3-uniform hypergraphs (Q2666573) (← links)
- Properly colored Hamilton cycles in Dirac-type hypergraphs (Q2692184) (← links)
- Hamilton cycles in quasirandom hypergraphs (Q2820275) (← links)
- On extremal hypergraphs for Hamiltonian cycles (Q2857378) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q2883632) (← links)
- The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (Q3068812) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q3300708) (← links)
- Extremal k-edge-hamiltonian Hypergraphs (Q3438961) (← links)
- Hamiltonian Chains in Hypergraphs (Q3439478) (← links)
- Hamiltonian decompositions of prisms over complete 3-uniform hypergraphs (Q3451069) (← links)
- Monochromatic Hamiltonian<i>t</i>-tight Berge-cycles in hypergraphs (Q3528158) (← links)
- (Q3576716) (← links)
- (Q4616112) (← links)
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs (Q4993132) (← links)
- (Q5000306) (← links)
- Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs (Q5020839) (← links)
- Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs (Q5028355) (← links)
- Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles (Q5106668) (← links)
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version (Q5371029) (← links)
- (Q5383282) (← links)
- (Q5403012) (← links)
- (Q5708622) (← links)
- Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs (Q5744160) (← links)
- Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654) (← links)
- The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs (Q6056724) (← links)
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q6076728) (← links)
- Minimum degree ensuring that a hypergraph is Hamiltonian-connected (Q6080369) (← links)
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs (Q6081575) (← links)
- Saturation for the 3-uniform loose 3-cycle (Q6091820) (← links)
- Existence of the map \(det^{S^3}\) (Q6131323) (← links)
- Minimum degree conditions for tight Hamilton cycles (Q6133938) (← links)
- Euler's theorem for regular CW-complexes (Q6548024) (← links)
- Pósa-type results for Berge hypergraphs (Q6574381) (← links)
- On Hamiltonian decompositions of complete 3-uniform hypergraphs (Q6611741) (← links)
- Optimal spread for spanning subgraphs of Dirac hypergraphs (Q6615765) (← links)
- Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs (Q6621151) (← links)
- A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs (Q6632775) (← links)
- A note on Hamilton \(\ell\)-cycle decomposition of complete \(k\)-partite hypergraphs (Q6633536) (← links)
- Transversal Hamilton cycle in hypergraph systems (Q6668348) (← links)
