Tuesday
March 28, 2017

Post a New Question

Posted by on .

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 - ,

    147

Answer This Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Post a New Question