|
Problemy Peredachi Informatsii, 2014, Volume 50, Issue 4, Pages 71–78
(Mi ppi2154)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Large Systems
On the number of $1$-factorizations of a complete graph
D. V. Zinoviev Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Abstract:
We study $1$-factorizations of a complete graph with $n$ vertices. The lower bound on the number of such factorizations is refined. A new proof of the upper bound is given.
Received: 18.12.2013 Revised: 14.04.2014
Citation:
D. V. Zinoviev, “On the number of $1$-factorizations of a complete graph”, Probl. Peredachi Inf., 50:4 (2014), 71–78; Problems Inform. Transmission, 50:4 (2014), 364–370
Linking options:
https://www.mathnet.ru/eng/ppi2154 https://www.mathnet.ru/eng/ppi/v50/i4/p71
|
Statistics & downloads: |
Abstract page: | 272 | Full-text PDF : | 104 | References: | 38 | First page: | 16 |
|