Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the number of 1-factorizations of a complete graph

On the number of 1-factorizations of a complete graph 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

On the number of 1-factorizations of a complete graph

Problems of Information Transmission , Volume 50 (4) – Jan 7, 2015

Loading next page...
 
/lp/springer_journal/on-the-number-of-1-factorizations-of-a-complete-graph-5ZCbwJfyLg

References (6)

Publisher
Springer Journals
Copyright
Copyright © 2014 by Pleiades Publishing, Inc.
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1134/S0032946014040061
Publisher site
See Article on Publisher Site

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.

Journal

Problems of Information TransmissionSpringer Journals

Published: Jan 7, 2015

There are no references for this article.