# Math Help - Graph Proofs- Isomorphic

1. ## Graph Proofs- Isomorphic

Let G be a graph with n vertices. Prove that there is a subgraph of Kn isomorphic to G.

Im unsure how to explain a proof for this. Would I just mention the 4 properties required for a graph to be isomorphic.

2. Make the given graph G as a complete graph $K_n$ by joining all non adjacent vertices. Then obviously $K_n$ contains $G$ as an induced subgraph upto isomorphism.