On the number of 1-factorizations of a complete graph

DOI10.1134/S0032946014040061zbMath1316.05103OpenAlexW2036729411WikidataQ114075240 ScholiaQ114075240MaRDI QIDQ2352638

Dmitrii Zinoviev

Publication date: 3 July 2015

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946014040061

zbMATH Keywords

\(n-1\)-matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Optimal patrolling strategies for trees and complete networks ⋮ Non-full-rank Steiner quadruple systems \(S(v,4,3)\)

Cites Work

• The maximum number of perfect matchings in graphs with a given degree sequence
• An upper bound on the number of Steiner triple systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of 1-factorizations of a complete graph