Two lower bounds for maximum matching
Combinatorics
2024-05-30 v1
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.
Keywords
Cite
@article{arxiv.2405.18446,
title = {Two lower bounds for maximum matching},
author = {Fedor Kuyanov},
journal= {arXiv preprint arXiv:2405.18446},
year = {2024}
}