Erdős–Pósa-type conjecture for cycles of distinct lengths
Statement
For a graph , let , and let denote the graph obtained by deleting the vertices in . Distinct-length cycle packing-cover conjecture. There exists a function such that every graph contains vertex-disjoint cycles with distinct lengths, or a set of at most vertices such that
This proposes an Erdős–Pósa-type dual certificate for cycles of pairwise distinct lengths; the source presents it as a possible improvement and does not state that it has been resolved.
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.