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, 2015, Volume 51, Issue 1, Pages 29–35 (Mi ppi2159)  

Large Systems

Fractional matchings in hypergraphs

V. M. Blinovskyab

a Instituto de Matemática e Estatística, Universidade de São Paulo, São Paulo, Brazil
b Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
References:
Abstract: We find an exact formula for the minimum number of edges in a hypergraph which guarantees a fractional matching of cardinality $s$ in the case where $sn$ is an integer.
Received: 10.02.2014
Revised: 15.09.2014
English version:
Problems of Information Transmission, 2015, Volume 51, Issue 1, Pages 25–30
DOI: https://doi.org/10.1134/S0032946015010032
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.1
Language: Russian
Citation: V. M. Blinovsky, “Fractional matchings in hypergraphs”, Probl. Peredachi Inf., 51:1 (2015), 29–35; Problems Inform. Transmission, 51:1 (2015), 25–30
Citation in format AMSBIB
\Bibitem{Bli15}
\by V.~M.~Blinovsky
\paper Fractional matchings in hypergraphs
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 1
\pages 29--35
\mathnet{http://mi.mathnet.ru/ppi2159}
\elib{https://elibrary.ru/item.asp?id=27041968}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 1
\pages 25--30
\crossref{https://doi.org/10.1134/S0032946015010032}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000352985900003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84957936934}
Linking options:
  • https://www.mathnet.ru/eng/ppi2159
  • https://www.mathnet.ru/eng/ppi/v51/i1/p29
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:233
    Full-text PDF :47
    References:39
    First page:30
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024