Ask a New Question

Question

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?

Details and assumptions
A simple graph does not have multiple edges between vertices, or self loops.
12 years ago

Answers

Alestair
269
12 years ago
Math defender
wrong
12 years ago

Related Questions

Prove that a simple graph with n >_ 2 vertices must have atleast two vertices with the same degree.... what is 200000 divided by 439? what is 200000 times 56 =? 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 p... Mr. Khalid invested 200000 at 12% simple interest and 189744 at 14% simple interest the two amounts... Exponential form for 200000 1000000000000 dovided by 20000000000 The graph shows a simple economy without a government sector or a foreign sector. It shows consumpti... The simple interest graph can correctly be described with one of the following / Die eenvoudige r... Ashira took a loan of $200000 from a bank which offers 15% interest compounded annually for 30 years...
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use