Post a New Question
posted by Sarah on Thursday, May 16, 2013 at 7:29pm.
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?
147
More Related Questions