Edge-disjoint cycles with the same vertex set | Research seminar in Discrete Mathematics
Abstract In 1975, Erdős asked for the maximum number of edges that an n-vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. This problem has since been