Minimal number of edges in hypergraph guaranteeing perfect fractional matching and MMS conjecture, complete version
Combinatorics
2017-03-16 v2
Abstract
In this paper we prove Ahlswede- Khachatrian conjecture~\cite{1} up to finite number of cases, which can be checked using modern computers. From this conjecture follows conjecture from~\cite{2} and Manickam-Mikl\'{o}s-Singhi conjecture. This paper is combined from papers~\cite{09},~\cite{08}.
Keywords
Cite
@article{arxiv.1510.01144,
title = {Minimal number of edges in hypergraph guaranteeing perfect fractional matching and MMS conjecture, complete version},
author = {Vladimir Blinovsky},
journal= {arXiv preprint arXiv:1510.01144},
year = {2017}
}
Comments
not needed to prove uniqueness it follows as sigma go to infinity, published versionProblems of Information Transmission not needed, uniqueness follows for limit process as sigma go to infinity. There exists printed version in arXiv:1310.0989 which correct