The multiple-constraint Erdős–Pósa conjecture
Statement
Let be a positive integer, and let
where each is a group. A -labeled graph is a graph whose edges are labeled by this direct sum, and a cycle is -non-zero when it is non-zero in every component.
Multiple-constraint Erdős–Pósa conjecture. The set of all -labeled graphs has the half-integral Erdős–Pósa property for -non-zero cycles. Moreover, the Erdős–Pósa function does not depend on the choice of .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.