Steiner systems and large non-Hamiltonian hypergraphs
From Steiner systems <em>S(k − 2, 2k − 3, v)</em>, we construct <em>k</em>-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].<br />
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
2006-10-01
|
| Series: | Le Matematiche |
| Subjects: | |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/114 |
| Summary: | From Steiner systems <em>S(k − 2, 2k − 3, v)</em>, we construct <em>k</em>-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].<br /> |
|---|---|
| ISSN: | 0373-3505 2037-5298 |