Dudeney set
Материал из WikiGrapp
Dudeney set --- множество Дьюдене.
Dudeney set in [math]\displaystyle{ K_{n} }[/math] is a set of Hamilton cycles with the property that every path of length two (2-path) in [math]\displaystyle{ K_{n} }[/math] lies on exactly one of the cycles. We call the problem of construction a Dudeney set in [math]\displaystyle{ K_{n} }[/math] for all natural numbers "Dudeney's round table problem" .
