保证完美分数匹配及MMS猜想的超图最小边数，完整版
组合数学
2017-03-16 v2
摘要
在本文中，我们证明了Ahlswede-Khachatrian猜想~\cite{1}在有限个情形下成立，这些情形可利用现代计算机进行验证。由该猜想可推出文献~\cite{2}中的猜想以及Manickam-Miklós-Singhi猜想。本文由文献~\cite{09}、~\cite{08}中的论文合并而成。
引用
@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}
}
备注
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