|
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
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
Citation:
V. M. Blinovsky, “Fractional matchings in hypergraphs”, Probl. Peredachi Inf., 51:1 (2015), 29–35; Problems Inform. Transmission, 51:1 (2015), 25–30
Linking options:
https://www.mathnet.ru/eng/ppi2159 https://www.mathnet.ru/eng/ppi/v51/i1/p29
|
Statistics & downloads: |
Abstract page: | 246 | Full-text PDF : | 51 | References: | 46 | First page: | 30 |
|