The question is:
Draw a simple graph with the following properties or explain why they do not exist. The graph has 6 vertices and 8 edges and its vertices can be divided into two sets in such a way that every edge joins a vertex in one set to a vertex in the other.
I don't understand this question but I tried doing this. Since every vertex needs to join every other vertex (for example, in the scenario with two sets where 1 set has 1 vertex and the other has 5 vertices), does this mean that for this graph to exist, there has to be n(n-1)/2 edges?