# Parameter: maximum induced matching

Definition:

For a graph $G = (V,E)$ an induced matching is an edge subset $M \subseteq E$ that satisfies the following two conditions: $M$ is a matching of the graph $G$ and there is no edge in $E \backslash M$ connecting any two vertices belonging to edges of the matching $M$. The parameter maximum induced matching of a graph $G$ is the largest size of an induced matching in $G$.

## Relations

Minimal/maximal is with respect to the contents of ISGCI. Only references for direct bounds are given. Where no reference is given, check equivalent parameters.

[+]Details

[+]Details

## Problems

Problems in italics have no summary page and are only listed when ISGCI contains a result for the current parameter.

3-Colourability Unknown to ISGCI [+]Details
Clique Unknown to ISGCI [+]Details
Clique cover Unknown to ISGCI [+]Details
Colourability Unknown to ISGCI [+]Details
Domination Unknown to ISGCI [+]Details
Feedback vertex set Unknown to ISGCI [+]Details
Graph isomorphism Unknown to ISGCI [+]Details
Hamiltonian cycle Unknown to ISGCI [+]Details
Hamiltonian path Unknown to ISGCI [+]Details
Independent set Unknown to ISGCI [+]Details
Maximum cut Unknown to ISGCI [+]Details
Monopolarity Unknown to ISGCI [+]Details
Polarity Unknown to ISGCI [+]Details
Weighted clique Unknown to ISGCI [+]Details
Weighted feedback vertex set Unknown to ISGCI [+]Details
Weighted independent set Unknown to ISGCI [+]Details