Extremal Graph Theory and Ramsey Theory · Medium problem

A graph has $12$ vertices and $20$ edges. What is the largest $k$ such that it must contain $k$ pairwise non-adjacent vertices?