Erdős–Pósa conjecture for long cycles through prescribed vertices
Statement
Let be a graph, let , and let be positive integers. An -cycle is a cycle containing a vertex of .
Long -cycle Erdős–Pósa conjecture. For every graph , every subset of vertices , and every pair of positive integers , there is either a set of disjoint -cycles of length at least , or a set with
such that contains no -cycle of length at least .
This conjecture improves the known bound of order for the corresponding hitting set when both parameters vary. The examples discussed in the source show that the dependence on and on 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.