Upper bounds on the minimum size of Hamilton saturated hypergraphs

zbMath1351.05165MaRDI QIDQ727183

Andrzej Ruciński, Andrzej Żak

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p12

zbMATH Keywords

hypergraphsHamiltonian cyclessaturation number

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph ⋮ Saturation for the 3-uniform loose 3-cycle ⋮ On the minimum size of Hamilton saturated hypergraphs ⋮ Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\)

Cites Work

• On extremal hypergraphs for Hamiltonian cycles
• Smallest maximally nonhamiltonian graphs
• Growth order for the size of smallest Hamiltonian chain saturated uniform hypergraphs
• Hamilton saturated hypergraphs of essentially minimum size
• Hamiltonian chains in hypergraphs

This page was built for publication: Upper bounds on the minimum size of Hamilton saturated hypergraphs