The Manickam-Miklós-Singhi Property in Graphs and Hypergraphs

Abstract

This paper studies the Manickam-Miklós-Singhi (MMS) property for graphs and hypergraphs. Using the structural characterisation of the $2$-uniform case, we construct new families of regular graphs with the MMS property. We then analyse the Erdős--Rényi random graph model $\mathbf{G}(n,p)$ and identify regimes in which the MMS property holds with high probability. Finally, we extend the matching-based sufficient condition to higher uniformities via pseudo-matchings and introduce a blowout construction that produces higher-uniformity hypergraphs with the MMS property from lower-uniformity examples.