This article is cited 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.

UDC: 621.391.1+519.1

Received: 18.12.2013
Revised: 14.04.2014

 English version: Problems of Information Transmission, 2014, 50:4, 364–370

Bibliographic databases:

• 
•