Every graph on n vertices is conjectured to decompose into O(n) cycles and edges; the random-graph and linear-minimum-degree cases are established special cases.
Statement
Every graph on n vertices is conjectured to decompose into O(n) cycles and edges; the random-graph and linear-minimum-degree cases are established special cases.
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.