# A Tighter Erdős-Pósa Function for Long Cycles

@article{Fiorini2014ATE, title={A Tighter Erdős-P{\'o}sa Function for Long Cycles}, author={Samuel Fiorini and Audrey Herinckx}, journal={ArXiv}, year={2014}, volume={abs/1205.0940} }

We prove that there exists a bivariate function f with f(k,l) = O(l k log k) such that for every naturals k and l, every graph G has at least k vertex-disjoint cycles of length at least l or a set of at most f(k,l) vertices that meets all cycles of length at least l. This improves a result by Birmel\'e, Bondy and Reed (Combinatorica, 2007), who proved the same result with f(k,l) = \Theta(l k^2).

#### Topics from this paper

#### 33 Citations

Long cycles through prescribed vertices have the Erdős-Pósa property

- Mathematics, Computer Science
- J. Graph Theory
- 2018

We prove that for every graph, any vertex subset S, and given integers k, `: there are k disjoint cycles of length at least ` that each contain at least one vertex from S, or a vertex set of size O(`… Expand

A tight Erdős-Pósa function for long cycles

- Mathematics, Computer Science
- J. Comb. Theory, Ser. B
- 2017

The tree-width of any graph G that does not contain k vertex-disjoint cycles of length at least l is of order O ( k l + k log k ) . Expand

Long Cycles have the Edge-Erdős-Pósa Property

- Mathematics, Physics
- Comb.
- 2019

We prove that the set of long cycles has the edge-Erdős-Pósa property: for every fixed integer ℓ ≥ 3 and every k ∈ ℕ, every graph G either contains k edge-disjoint cycles of length at least ℓ (long… Expand

The Erdős-Pósa Property for Long Circuits

- Computer Science, Mathematics
- J. Graph Theory
- 2014

For an integer i�� at least 3, we prove that if G is a graph containing no two vertex-disjoint circuits of length at least i��, then there is a set X of at most 53i��+292 vertices that intersects all… Expand

On the Erd\H{o}s-P\'osa property for long holes in $C_4$-free graphs

- Mathematics, Computer Science
- 2021

It is proved that there exists a function f(k) = O(k log k) such that for every C4-free graph G and every k ∈ N, G either contains k vertex-disjoint holes of length at least 6, or a set X such that G−X has no hole of lengthat least 6. Expand

K4-expansions have the edge-Erdős-Pósa property

- Mathematics, Computer Science
- Electron. Notes Discret. Math.
- 2017

It is proved that the family of graphs that have K4 as a minor has the edge-Erdős-Posa property. Expand

Erd\H{o}s-P\'osa from ball packing

- Mathematics, Computer Science
- 2019

It is shown that every graph G either contains k edge-disjoint cycles of length at least l or an edge set F of size O(kl · log(kl) such that G − F has no cycle of length least l, which improves on the previously best known bound of O(k log k + kl). Expand

Erdős-Pósa property of chordless cycles and its applications

- Mathematics, Computer Science
- J. Comb. Theory, Ser. B
- 2020

It is shown that chordless cycles of length at least l for any fixed l ≥ 5 do not have the Erdős-Posa property, and an approximation algorithm of factor O ( opt log opt ) for Chordal Vertex Deletion . Expand

A tight Erdős-Pósa function for wheel minors

- Computer Science, Mathematics
- SIAM J. Discret. Math.
- 2018

It is proved that for every integer t there is a constant c=c(t) such that forevery integer t and every graph G, either G has k or has ve... Expand

Half-integral Erd\H{o}s-P\'osa property of directed odd cycles

- Mathematics
- 2020

We prove that there exists a function $f:\mathbb{N}\rightarrow \mathbb{R}$ such that every digraph $G$ contains either $k$ directed odd cycles where every vertex of $G$ is contained in at most two of… Expand

#### References

SHOWING 1-9 OF 9 REFERENCES

The Erdős–Pósa Property For Long Circuits

- Mathematics, Computer Science
- Comb.
- 2007

It is obtained as a corollary that graphs without k disjoint circuits of length l or more have tree-width O(lk2), thereby sharpening a result of C. Thomassen. Expand

The Erdős-Pósa Property for Long Circuits

- Computer Science, Mathematics
- J. Graph Theory
- 2014

For an integer i�� at least 3, we prove that if G is a graph containing no two vertex-disjoint circuits of length at least i��, then there is a set X of at most 53i��+292 vertices that intersects all… Expand

Excluded Forest Minors and the Erdős–Pósa Property

- Computer Science, Mathematics
- Combinatorics, Probability and Computing
- 2013

It is shown that the function f can be taken to be linear when H is a forest, best possible in the sense that no linear bound is possible if H has a cycle. Expand

Graph minors. V. Excluding a planar graph

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 1986

We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructed from graphs with at most w vertices, by piecing them together in a… Expand

ON INDEPENDENT CIRCUITS CONTAINED IN A GRAPH

- 2004

A family of circuits of a graph G is said to be independent if no two of the circuits have a common vertex ; it is called edge-independent if no two of them have an edge in common . A set of vertices… Expand

Graph theory, volume 173 of Graduate Texts in Mathematics

- Graph theory, volume 173 of Graduate Texts in Mathematics
- 2010

Reed . The ErdősPósa property for long circuits

- Combinatorica
- 2007

Department of Mathematics CP 216, Boulevard du Triomphe, B-1050 Brussels

- Department of Mathematics CP 216, Boulevard du Triomphe, B-1050 Brussels