Let G be a simple graph with 2n vertices and n2 edges. If G has no triangles, then G is the complete bipartite graph Kn,n.

For each proof complete the following:

- State the hypotheses

- State the conclusions

- Clearly and precisely prove the conclusions from the hypotheses