ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let t≥1t\geq 1 be a positive integer, and let

Γ=⨁i=1tΓi,\Gamma=\bigoplus_{i=1}^t\Gamma_i,

where each Γi\Gamma_i is a group. A ⨁i=1tΓi\bigoplus_{i=1}^t\Gamma_i-labeled graph is a graph whose edges are labeled by this direct sum, and a cycle is (Γ1,…,Γt)(\Gamma_1,\dots,\Gamma_t)-non-zero when it is non-zero in every component.

Multiple-constraint Erdős–Pósa conjecture. The set of all ⨁i=1tΓi\bigoplus_{i=1}^t\Gamma_i-labeled graphs has the half-integral Erdős–Pósa property for (Γ1,…,Γt)(\Gamma_1,\dots,\Gamma_t)-non-zero cycles. Moreover, the Erdős–Pósa function does not depend on the choice of Γ1,…,Γt\Gamma_1,\dots,\Gamma_t.

This would imply the half-integral Erdős–Pósa property for cycles satisfying more than two constraints. The conjecture proposes a uniform Erdős–Pósa function across all choices of the component groups; its resolution is not given in the source.

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.