1-Factorization of K 2n: различия между версиями

Перейти к навигации Перейти к поиску
м
нет описания правки
(Новая страница: «'''1-Factorization of <math>K_{2n}</math>''' --- один-факторизация графа <math>K_{2n}</math>. A '''one-factorization''' of <math>K_{2n}</math>…»)
 
мНет описания правки
 
Строка 6: Строка 6:
distinct one-factors forms a Hamiltonian cycle of <math>K_{2n}</math>. P1Fs of
distinct one-factors forms a Hamiltonian cycle of <math>K_{2n}</math>. P1Fs of
<math>K_{2n}</math> are known to exist when <math>2n-1</math> or <math>n</math> is prime, and for <math>2n
<math>K_{2n}</math> are known to exist when <math>2n-1</math> or <math>n</math> is prime, and for <math>2n
\in \{16, 28, 36,40, 50, 126, 170, 244, 344, 730, \\ 1332, 1370, 1850,
\in \{16, 28, 36,40, 50, 126, 170, 244, 344, 730, 1332, 1370, 1850,
2198, 3126, 6860, 12168, 16808, 29792\}</math>.
2198, 3126, 6860, 12168, 16808, 29792\}</math>.


It has been conjectured that
It has been conjectured that
a perfect one-factorization of <math>K_{2n}</math> exists for all <math>n \geq 2</math>.
a perfect one-factorization of <math>K_{2n}</math> exists for all <math>n \geq 2</math>.
7

правок

Навигация