RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 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

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.

UDC: 621.391.1+519.1

Received: 10.02.2014
Revised: 15.09.2014


 English version: Problems of Information Transmission, 2015, 51:1, 25–30

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024