Constructs new families of regular graphs with the MMS property, identifies high-probability regimes in Erdős–Rényi graphs, and extends sufficient conditions to hypergraphs using pseudo-matchings and blowout constructions.
Edge-disjoint Hamilton cycles in random graphs.Random Structures & Algorithms, 46(3):397–445, 2015
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Manickam-Mikl\'os-Singhi Property in Graphs and Hypergraphs
Constructs new families of regular graphs with the MMS property, identifies high-probability regimes in Erdős–Rényi graphs, and extends sufficient conditions to hypergraphs using pseudo-matchings and blowout constructions.