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

Mar 24, 2015

Vladimir Blinovsky

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.

The whole paper is available here.

Share on Twitter Share on Facebook