The following pages link to Hamiltonian chains in hypergraphs (Q4237729):
Displaying 50 items.
- Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees (Q274673) (← links)
- Extension of paths and cycles for hypergraphs (Q277496) (← links)
- Bounds on the number of edges in hypertrees (Q279202) (← links)
- On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs (Q393157) (← links)
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- Monochromatic loose-cycle partitions in hypergraphs (Q405239) (← 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)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- Upper bounds on the minimum size of Hamilton saturated hypergraphs (Q727183) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q739066) (← links)
- The Turán number of sparse spanning graphs (Q744159) (← links)
- A mathematical approach on representation of competitions: competition cluster hypergraphs (Q778654) (← links)
- Perfect matchings in uniform hypergraphs with large minimum degree (Q850084) (← links)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609) (← links)
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs (Q949794) (← links)
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs (Q965258) (← links)
- Hamilton-chain saturated hypergraphs (Q966015) (← links)
- Hamilton \(\ell \)-cycles in uniform hypergraphs (Q986125) (← links)
- Perfect matchings in large uniform hypergraphs with large minimum collective degree (Q1024365) (← links)
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (Q1689892) (← links)
- Forcing large tight components in 3-graphs (Q1715624) (← links)
- The Turán number for spanning linear forests (Q1720343) (← links)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- Hamilton saturated hypergraphs of essentially minimum size (Q1953507) (← links)
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs (Q2032885) (← links)
- On Hamiltonian cycles in hypergraphs with dense link graphs (Q2040014) (← 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)
- Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\) (Q2111195) (← links)
- Spanning surfaces in \(3\)-graphs (Q2119367) (← links)
- Hamiltonian paths and cycles in some 4-uniform hypergraphs (Q2157837) (← links)
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
- On the minimum size of Hamilton saturated hypergraphs (Q2213813) (← links)
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (Q2220980) (← links)
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs (Q2258905) (← links)
- On extremal hypergraphs for forests of tight paths (Q2279249) (← links)
- Spectra of cycle and path families of oriented hypergraphs (Q2321360) (← links)
- Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs (Q2342629) (← 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)
- Rainbow connection for some families of hypergraphs (Q2449162) (← links)
- Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
