How many edges does a n vertex triangle free graph contains?

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Design and Analysis of Algorithms

Q. How many edges does a n vertex triangle free graph contains?

(A) n2
(B) n2 + 2
(C) n2 / 4
(D) n3

💬 Discuss

✅ Correct Answer: (C) n2 / 4

Explanation: a n vertex triangle free graph contains a total of n2 / 4 number of edges. this is stated by mantel’s theorem which is a special case in turan’s theorem for r=2.

Explanation by: Mr. Dubey

a n vertex triangle free graph contains a total of n2 / 4 number of edges. this is stated by mantel’s theorem which is a special case in turan’s theorem for r=2.

💬 Discussion

📊 Question Analytics

👁️

282

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate