Kn is a complete graph with n vertices. In a complete graph, there is an edge between every pair of different vertices. The subgraph induced by a set of m vertices contains all of the edges involving those vertices, so it must clearly be complete.