V. M. Blinovsky, “Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture”, Probl. Peredachi Inf., 2014, Volume 50, Issue 4,Pages <nobr>43

This article is cited in 3 papers

Large Systems

Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture

V. M. Blinovsky^ab

^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–Miklós–Singhi conjecture.

UDC: 621.391.1+519.1

Received: 10.02.2014
Revised: 25.08.2014