A simple graph $G$ with $n$ vertices has at least $n+4$ edges. Prove that it has two cycles having no common edge.
If ${\lvert{E(G)}\rvert}>{\lvert{V(G)}\rvert}+3$, graph $G$ has at least two disjoint cycles.