Thursday
April 24, 2014

Homework Help: Geometry

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?

Answer this Question

First Name:
School Subject:
Answer:

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 ...
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...
Discrete Mathematics - Consider the complete graph with 5 vertices, denoted by ...
Geometry - If you marked the midpoints of the edges of a cube and sliced off all...
Discrete Mathematics - If we consider the G as the whole of the cycle graph ...
geometry - 1.in which geometry do lines no contain an infinite number of points...
geometry - If a rectangular solid has a volume of 27 and at least one edge the ...
Geometry-help - If a rectangular solid has a volume of 27 and at least one edge ...

Search
Members