Every graph contains k vertex-disjoint cycles of distinct lengths or has a set of O(k^6 polylog(k)) vertices whose removal leaves at most k-1 cycle lengths.
A conjecture on triangles of graphs
2 Pith papers cite this work, alongside 54 external citations. Polarity classification is still indexing.
2
Pith papers citing it
54
external citations · OpenAlex
fields
math.CO 2years
2026 2representative citing papers
Prime-length cycles and all zero lower-density length sets lack the 1/t-integral Erdős-Pósa property even in planar graphs, with a further failure for porous sets in projective planar graphs.
citing papers explorer
-
An Erd\H{o}s-P\'osa theorem for cycles and faces of distinct lengths
Every graph contains k vertex-disjoint cycles of distinct lengths or has a set of O(k^6 polylog(k)) vertices whose removal leaves at most k-1 cycle lengths.
-
The Erd\H{o}s-P\'osa property for prime-length cycles fails (and beyond)
Prime-length cycles and all zero lower-density length sets lack the 1/t-integral Erdős-Pósa property even in planar graphs, with a further failure for porous sets in projective planar graphs.