Erdős Problem #585 — What is the maximum number of edges that a graph on vertices can have if it does not contain two edge-disjoint cycles with the same vertex set?
What is the maximum number of edges that a graph on vertices can have if it does not contain two edge-disjoint cycles with the same vertex set?
References
Primary source
Additional references
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.