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 ...
- Graph Theory/ Algorithms / Computer science - I am working on this problem from ...
- 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...
- Geometry - 1 How many faces does a square pyramid have? 2 How many edges does a ...
- Discrete Mathematics - Let G be a graph with vertex set V = {v1, v2, v3, v4, v5...
- geometry - If a rectangular solid has a volume of 27 and at least one edge the ...
- math - If a polyhedron has 13 vertices and 21 faces, how many edges does it have...