Erdős–Pósa-type conjecture for cycles of distinct lengths
For a graph , let , and let denote the graph obtained by deleting the vertices in . Distinct-length cycle packing-cover conjecture. There exists a function such that every graph contains vertex-disjoint cycles with distinct lengths, or a set of at most vertices such that
This proposes an Erdős–Pósa-type dual certificate for cycles of pairwise distinct lengths; the source presents it as a possible improvement and does not state that it has been resolved.
References
- J. Pascal Gollin, Maximilian Gorsky, Meike Hatzel, Kevin Hendrey, Tony Huynh, Caleb McFarland, Marek Sokołowski, Sebastian Wiederrecht and Paul Wollan, “An Erdős-Pósa theorem for cycles and faces of distinct lengths”, arXiv:2607.06869 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.