Extremal Graph Theory and Ramsey Theory · Superchallenge problem

How many labeled graphs on $5$ vertices contain no triangle and no $3$ pairwise non-adjacent vertices?