Consider a maximal matching M in G = (V, E). Let T = {v V : some edge in M is incident on v}. What can you say about the subgraph of G induced by the vertices of G that are not in T ? (A subgraph of G = (V, E) induced by a subset of vertices V V is subgraph G = (V , E) consisting of vertices V and edges E E, such that for each edge (u, v) E, both u V and v V .)