Atlas home || Conferences | Abstracts | about Atlas

25th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing
December 4-8, 2000
University of Canterbury
Christchurch, New Zealand

Organizers
Charles Semple, Mike Steel

View Abstracts
Conference Homepage

Dudeney's Round Table Problem
by
Midori Kobayashi
University of Shizuoka, Japan
Coauthors: Kiyasu-Zen'iti (Semiconductor Research Institute), Gisaku Nakamura (Tokai University)

A Dudeney set in Kn is a set of Hamilton cycles with the property that every path of length two lies on exactly one of the cycles. We call the problem of construction a Dudeney set ``Dudeney's round table problem''. It has been solved when n is even, but the problem when n is odd is still open. In this talk we show some new series of Dudeney sets and some results about double Dudeney sets.

Date received: November 10, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafn-48.