Growth order for the size of smallest Hamiltonian chain saturated uniform hypergraphs

DOI10.1016/J.EJC.2012.10.009zbMath1259.05124OpenAlexW1998516233MaRDI QIDQ1940361

Andrzej Żak

Publication date: 6 March 2013

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.10.009

zbMATH Keywords

Hamiltonian cyclesaturated graphs

Mathematics Subject Classification ID

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

Related Items (3)

Hamilton saturated hypergraphs of essentially minimum size ⋮ Upper bounds on the minimum size of Hamilton saturated hypergraphs ⋮ Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\)

This page was built for publication: Growth order for the size of smallest Hamiltonian chain saturated uniform hypergraphs