Erdős Problem #584 — Let G be a graph with n vertices and δ n^2 edges.
Statement
Let be a graph with vertices and edges. Are there subgraphs such that
-
has edges and every two edges in are contained in a cycle of length at most , and furthermore if two edges share a vertex they are on a cycle of length , and
-
has edges and every two edges in are contained in a cycle of length at most .
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.