Post a New Question


posted by .

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 -


Answer This Question

First Name:
School Subject:

Related Questions

More Related Questions

Post a New Question