Minimal number of edges in hypergraph guaranteeing perfect fractional matching and MMS conjecture, complete version
Abstract
In this paper we prove Ahlswede- Khachatrian conjecture~1 up to finite number of cases, which can be checked using modern computers. From this conjecture follows conjecture from~2 and Manickam-Mikl\'os-Singhi conjecture. This paper is combined from papers~09,~08.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.