Upper bounds on the minimum size of Hamilton saturated hypergraphs

MaRDI QIDQ727183zbMATH OpenFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Hamiltonian cycleshypergraphssaturation number

Mathematics Subject Classification ID

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

Recommendations

• On the minimum size of Hamilton saturated hypergraphs
• Hamilton saturated hypergraphs of essentially minimum size
• Constructing sparsest -Hamiltonian saturated k-uniform hypergraphs for a wide range of
• Hamilton-chain saturated hypergraphs
• scientific article; zbMATH DE number 6273737

Cites work

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

Cited in

(8)

• Growth order for the size of smallest Hamiltonian chain saturated uniform hypergraphs
• Hamilton saturated hypergraphs of essentially minimum size
• Constructing sparsest -Hamiltonian saturated k-uniform hypergraphs for a wide range of
• On the minimum size of Hamilton saturated hypergraphs
• Hamiltonian path saturated graphs with small size
• Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph
• Saturation for the 3-uniform loose 3-cycle
• Hamilton-chain saturated hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727183)