Erdős Problem #585 — What is the maximum number of edges that a graph on n vertices can have if it does not contain two edge-disjoint cycles with the same vertex set?
Statement
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?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.