Asked by HELP!!
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.
Details and assumptions
A simple graph does not have multiple edges between vertices, or self loops.
Answers
Answered by
Alestair
269
Answered by
Math defender
wrong
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.