A 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?
4 answers
16
wrong...blunder..even for a simple graph with all vertices connected is given by n(n=1)/2 for 16 it is 15*8<<200000
538
895
1 answer