A simple graph G has 200000 edges and for any 3 vertices v,w,x, at least one of the edges vw,wx,xv is not present in G. What is the least number of vertices that G can have?
1 answer
147
1 answer
2 answers
4 answers
1 answer
1 answer