Dudeney set: различия между версиями

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
(Новая страница: «'''Dudeney set''' --- множество Дьюдене.»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Dudeney set''' --- множество Дьюдене.
'''Dudeney set''' --- множество Дьюдене.
'''Dudeney set''' in <math>K_{n}</math> is a set of ''Hamilton cycles'' with
the property that every path of length two (2-path) in <math>K_{n}</math> lies on
exactly one of the cycles. We call the problem of construction a
Dudeney set in <math>K_{n}</math> for all natural numbers
'''"Dudeney's round table problem" '''.

Текущая версия от 17:41, 5 апреля 2011

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