The half-integral reduction conjecture for labelled cycles
The half-integral reduction conjecture for labelled cycles
For an abelian group , a subset , and a -labelled graph , let denote the set of cycles whose -values lie in . Half-integral reduction conjecture. Let be an integer. If there is a function such that, for every -labelled graph and every positive integer , there are either cycles in such that no vertex belongs to of them, or a hitting set for of size at most , then there is a function such that, for every -labelled graph and every positive integer , there are either cycles in such that no vertex belongs to three of them, or a hitting set for of size at most . This proposes that an Erdős–Pósa property with bounded vertex overlap implies its half-integral analogue with overlap three for cycles whose group values lie in ; the supplied text gives no resolution.
Sources & referencesView supporting material
Primary source
J. Pascal Gollin, Kevin Hendrey, O-joung Kwon, Sang-il Oum and Youngho Yoo, “A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups”, arXiv:2209.09488 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.