This research demonstrates a geometric criterion for perfect matchings in regular graphs, suggesting edge-connectivity links to curvature.
We establish a sharp edge-connectivity estimate for graphs with non-negative Bakry-Émery curvature. This leads to a geometric criterion for the existence of a perfect matching. Precisely, we show that any regular graph with non-negative Bakry-Émery curvature and an even or infinite number of vertices has a perfect matching. Through a synthesis of combinatorial and curvature-related techniques, we determine the edge-connectivity of (possibly infinite) amply regular graphs.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: