maximum induced matching
- unknown
- maximum induced matching $k$ upper bounds diameter by $f(k)$
- maximum independent set $k$ upper bounds maximum induced matching by $f(k)$
- maximum matching $k$ upper bounds maximum induced matching by $\mathcal O(k)$ – By definition
- https://www.sciencedirect.com/science/article/pii/0166218X9290275F?via%3Dihub
- maximum induced matching – An induced matching in a graph G is a set of edges, no two of which meet a common node or are joined by an edge of G;