ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let Λ(G)={ℓ∈N∣G contains a cycle of length ℓ}\Lambda(G)=\{\ell\in\mathbb{N}\mid G\text{ contains a cycle of length }\ell\}, and let G−XG-X denote the graph obtained by deleting the vertices in XX. Distinct-length cycle packing-cover conjecture. There exists a function f(k)∈O(klog⁡k)f(k)\in\mathcal{O}(k\log k) such that every graph GG contains kk vertex-disjoint cycles with distinct lengths, or a set XX of at most f(k)f(k) vertices such that

∣Λ(G−X)∣≤k−1.|\Lambda(G-X)|\leq k-1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.