# Geometry

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 -

147

## Similar Questions

1. ### Geometry

1 How many faces does a square pyramid have?
2. ### Proof! Help!

If k vertices has kC2 edges, show that (k+1) vertices has (k+1) C 2 edges
3. ### math

Suppose G is a connected, simple, planar graph with 100 vertices. What is the largest possible number of edges in G?
4. ### math

Suppose G is a connected, simple, planar graph with 100 vertices. What is the largest possible number of edges in G?
5. ### 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?
6. ### 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?
7. ### 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?
8. ### 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 polynomial-time algorithm that ﬁnds ceil(V /2) vertices that collectively cover at least three-fourths (3/4) …
9. ### math

how many edges , vertices and faces does a cylinder have?
10. ### 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?

More Similar Questions