A simple graph has 200000 edges and for any 3 vertices at least one of the edges is not present in What is the least number of vertices that can have?
Details and assumptions
A simple graph does not have multiple edges between vertices, or self loops.