Search papers, labs, and topics across Lattice.
1
0
A hypergraph's minimum degree dictates its perfect matching existence, with a novel proof connecting fractional matchings to a key probabilistic inequality.