A simple connected graph on 100 vertices has 102 edges. Show that.....................

380 Views Asked by At

A simple connected graph on 100 vertices has 102 edges. Show that the graph contains three pairwise different cycles. (Two cycles are different if their edge sets are not the same.)

How to solve this question ?

Thanks in advance!