Drawing Graph on 5 vertices. Draw a graph on 5 vertices that contains no clique of size three (that is, no triangle) and no anti-clique of size three (that is, three vertices none of which is connected to any other).


Here are a few graphs which I made. The problem I'm having is I don't quite understand what the question is asking me for. Like user96614 suggested, a ring could work too. So am I suppose to just come up with some graph with 5 vertices where no 3 vertices are together and no 3 vertices are alone? 

The problem is probably asking you to find a graph such that for an three points , those three points don't form the triangle $C_3$ or its complement, the edgeless graph on 3 vertices. So the cycle $C_5$ works.
You can think of cliques as a collection of people where everyone is friends with each other and of anti-cliques as a collection of people where no two people in this collection are friends. 
