Edges in a graph with no triangles

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

Details and assumptions

A simple graph does not have multiple edges between vertices, or self loops.

×

Problem Loading...

Note Loading...

Set Loading...