Le Matematiche (Oct 2006)

Steiner systems and large non-Hamiltonian hypergraphs

  • Zsolt Tuza

Journal volume & issue
Vol. 61, no. 1
pp. 179 – 183

Abstract

Read online

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].

Keywords