Geometry
posted by Sarah .
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?

147
Respond to this Question
Similar Questions

Geometry
1 How many faces does a square pyramid have? 
Proof! Help!
If k vertices has kC2 edges, show that (k+1) vertices has (k+1) C 2 edges 
math
Suppose G is a connected, simple, planar graph with 100 vertices. What is the largest possible number of edges in G? 
math
Suppose G is a connected, simple, planar graph with 100 vertices. What is the largest possible number of edges in G? 
Geaometry (Graph)
A 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? 
MATHS
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? 
Discrete Mathematics
Let G be a graph with vertex set V = {v1, v2, v3, v4, v5}. A. Is it possible for the degrees of the vertices to be 3, 6, 2, 1, 5, respectively? 
Graph Theory/ Algorithms / Computer science
I am working on this problem from the book, Data Structures & Algorithm Analysis in C++. The problem is: 9.40 Give a polynomialtime algorithm that ﬁnds ceil(V /2) vertices that collectively cover at least threefourths (3/4) … 
math
how many edges , vertices and faces does a cylinder have? 
Geometry (check)
Mario’s company makes unusually shaped imitation gemstones. One gemstone had 12 faces and 10 vertices. How many edges did the gemstone have?