4 citations · 4 across the 3 of their papers we have counts for
1 paper · 1 filter
Fedor Kuyanov
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…