In graph theory, a part of mathematics, a $k$-partite graph is a graph whose vertices are or can be partitioned into $k$ different independent sets.
A vertex-induced subgraph (sometimes simply called an "induced subgraph") is a subset of the vertices of a graph $G$ together with any edges whose endpoints are both in this subset.
So, i want to prove that a graph is complete multipartite, iff it has no $k_1 \bigcup k_2$ as a vertex-induced subgraph.
$k_1$ is a graph that has just one vertex and no edges. $k_2$ is a graph with $2$ vertices and $1$ edge.
So the union of them makes a graph with $3$ vertices and $1$ edge. Call this graph $H$. I want to prove that a graph like $G$ is complete multipartite iff it has no $H$ as its vertex-induced subgraph.
Thanks in advance.