14 citations · 19 across the 8 of their papers we have counts for
1 paper · 2 filters
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof +2
An induced matching in a graph is a set of edges whose endpoints induce a 1-regular subgraph. It is known that any n-vertex graph has at most 10n/5≈1.5849n maxima…