ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar graph. A cycle packing is a set of vertex-disjoint cycles in GG; let cp⁡(G)\operatorname{cp}(G) denote its maximum size. A feedback vertex set is a set SS of vertices such that G−SG-S is a forest; let fvs⁡(G)\operatorname{fvs}(G) denote the minimum size of a feedback vertex set.

Jones' Conjecture. Every planar graph GG satisfies

fvs⁡(G)⩽2⋅cp⁡(G).\operatorname{fvs}(G)\leqslant 2\cdot\operatorname{cp}(G).

This conjecture concerns the relationship between cycle packing and feedback vertex sets, strengthening the general Erdős–Pósa-type bound for planar graphs. The source confirms the conjecture for subcubic planar graphs, but the general planar case remains open.

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.