|
Problemy Peredachi Informatsii, 2014, Volume 50, Issue 4, Pages 43–54
(Mi ppi2152)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Large Systems
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
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:
In this paper we prove the Ahlswede–Khachatrian conjecture [1] up to a finite number of cases, which can be checked using modern computers. This conjecture implies the conjecture from [2] and the Manickam–Miklós–Singhi conjecture.
Received: 10.02.2014 Revised: 25.08.2014
Citation:
V. M. Blinovsky, “Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture”, Probl. Peredachi Inf., 50:4 (2014), 43–54; Problems Inform. Transmission, 50:4 (2014), 340–349
Linking options:
https://www.mathnet.ru/eng/ppi2152 https://www.mathnet.ru/eng/ppi/v50/i4/p43
|
Statistics & downloads: |
Abstract page: | 282 | Full-text PDF : | 87 | References: | 47 | First page: | 18 |
|