Thanks:  0

1. I have already proved that for a graph $G$ with $n$ vertices and $|E(T'(n,q))|$ edges, $\alpha (G) \geq q$. Additionally, if $\alpha (G) = q$ then it must be that $G \cong T'(n,q)$.

Apparently this is the "dual version" of Turan's Theorem. How does this theorem imply Turan's?

That $ex(n, K_{p+1}) = |E(T(n,p))|$

Where:

- $T'(n,q)$ : $q$ disjoint cliques with size as equal as possible
- $\alpha (G)$ : independence number of $G$
- $ex(n, K_{p+1})$ : max number of edges in an n-vertex graph with no $K_{p+1}$ subgraph

2.