Let $G = (V, E)$ be a p-regular bipartite graph, prove that total length of all cycles is at most pm.

62 Views Asked by At

Let $G = (V, E)$ be a $p$-regular bipartite graph, prove that total length of all cycles is at most $pm$. I don't know how to start, any ideas would help.