Steiner systems and large non-Hamiltonian hypergraphs

  • Zsolt Tuza
Keywords: hypergraph, Hamiltonian cycle, Steiner system

Abstract

From Steiner systems S(k − 2, 2k − 3, v), we construct k-uniform hyper- graphs of large size without Hamiltonian cycles. This improves previous estimates due to G. Y. Katona and H. Kierstead [J. Graph Theory 30 (1999), pp.  205–212].
Published
2006-10-01
Section
Articoli