Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Cameron (1976)
Parallelisms Of Complete Designs
N. Linial, Zur Luria (2011)
An upper bound on the number of Steiner triple systemsRandom Structures & Algorithms, 43
N Linial, Z Luria (2013)
Upper Bound on the Number of Steiner Triple Systems and 1-FactorizationsRandom Structures Algorithms, 43
N. Alon, S. Friedland (2008)
The Maximum Number of Perfect Matchings in Graphs with a Given Degree SequenceElectron. J. Comb., 15
J. Lint, R. Wilson (1992)
A course in combinatorics
M Hall (1967)
Combinatorial Theory
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.
Problems of Information Transmission – Springer Journals
Published: Jan 7, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.