An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs
From MaRDI portal
Recommendations
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- On Hamiltonian cycles in hypergraphs with dense link graphs
- scientific article; zbMATH DE number 7448677
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
Cites work
- An approximate Dirac-type theorem for k-uniform hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hamiltonian chains in hypergraphs
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Note on Hamilton Circuits
- Some Theorems on Abstract Graphs
Cited in
(9)- Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- Matching in 3-uniform hypergraphs
- Vertex degree sums for matchings in 3-uniform hypergraphs
- Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
- scientific article; zbMATH DE number 7448677 (Why is no real title available?)
- Vertex degree sums for matchings in 3-uniform hypergraphs
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- Ore-type condition for Hamilton -cycle in k-uniform hypergraphs
This page was built for publication: An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526237)
