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?

Geometry  JIM, Friday, May 17, 2013 at 12:52pm
147
Answer This Question
Related Questions
 MATHS  A simple graph G has 200000 edges and for any 3 vertices v,w,x, at least...
 Geaometry (Graph)  A graph G has 200000 edges and for any 3 vertices v,w,x, at ...
 Geometry (check)  Mario’s company makes unusually shaped imitation gemstones. ...
 Graph Theory/ Algorithms / Computer science  I am working on this problem from ...
 math  how many edges , vertices and faces does a cylinder have? some say 0 ...
 Geometry  1 How many faces does a square pyramid have? 2 How many edges does a ...
 math  Suppose G is a connected, simple, planar graph with 100 vertices. What is...
 math  Suppose G is a connected, simple, planar graph with 100 vertices. What is...
 Proof! Help!  If k vertices has kC2 edges, show that (k+1) vertices has (k+1) C...
 Discrete Mathematics  Let G be a graph with vertex set V = {v1, v2, v3, v4, v5...
More Related Questions