Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

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
Full-text PDF (142 kB) Citations (4)
References:
PDF
HTML
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
English version:
Problems of Information Transmission, 2014, Volume 50, Issue 4, Pages 364–370
DOI: https://doi.org/10.1134/S0032946014040061
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.1
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Zin14}
\by D.~V.~Zinoviev
\paper On the number of $1$-factorizations of a~complete graph
\jour Probl. Peredachi Inf.
\yr 2014
\vol 50
\issue 4
\pages 71--78
\mathnet{http://mi.mathnet.ru/ppi2154}
\transl
\jour Problems Inform. Transmission
\yr 2014
\vol 50
\issue 4
\pages 364--370
\crossref{https://doi.org/10.1134/S0032946014040061}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000347532800006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84920628697}
Linking options:
  • https://www.mathnet.ru/eng/ppi2154
  • https://www.mathnet.ru/eng/ppi/v50/i4/p71
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024