ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let S⊆V(G)S\subseteq V(G), and let k,ℓk,\ell be positive integers. An SS-cycle is a cycle containing a vertex of SS.

Long SS-cycle Erdős–Pósa conjecture. For every graph GG, every subset of vertices SS, and every pair of positive integers k,ℓk,\ell, there is either a set of kk disjoint SS-cycles of length at least ℓ\ell, or a set XX with

∣X∣=O(k(ℓ+log⁡k))|X|=O\bigl(k(\ell+\log k)\bigr)

such that G−XG-X contains no SS-cycle of length at least ℓ\ell.

This conjecture improves the known bound of order O(ℓklog⁡k)O(\ell k\log k) for the corresponding hitting set when both parameters vary. The examples discussed in the source show that the dependence on kk and on ℓ\ell cannot generally be reduced when the other parameter is fixed, while the optimal bound when both grow 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.