How many edges does a n vertex triangle free graph contains?
|B.||n2 + 2|
|C.||n2 / 4|
|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.|
Login to Continue
It will take less than 2 minutes