Minimum Number of Edges in a Hypergraph Guaranteeing a Perfect Fractional Matching and the MMS Conjecture

作者：Blinovsky V M^*

来源：Problems of Information Transmission, 2014, 50(4): 340-349.

DOI：10.1134/S0032946014040048

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-Mikls-Singhi conjecture.

• 出版日期2014-10