Two lower bounds for maximum matching
Fedor Kuyanov
TL;DR
This paper presents two simple yet lesser-known lower bounds for the maximum matching size in any undirected graph, providing clear combinatorial proofs to enhance understanding.
Contribution
It introduces two new lower bounds for maximum matching size with straightforward combinatorial proofs, filling a gap in existing graph theory literature.
Findings
Two lower bounds for maximum matching size established
Proofs are simple and combinatorial in nature
Results are not widely known despite their simplicity
Abstract
In this paper, we prove two lower bounds for the maximum matching size in an arbitrary undirected graph. Despite their simplicity, these results are not widely known. This article aims to bring pleasure to the reader by giving short combinatorial proofs of these easy-to-state estimates.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs