# Packing cycles through prescribed vertices

```@article{Kakimura2011PackingCT,
title={Packing cycles through prescribed vertices},
author={Naonori Kakimura and K. Kawarabayashi and D. Marx},
journal={J. Comb. Theory, Ser. B},
year={2011},
volume={101},
pages={378-381}
}```
• Published 2011
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
The well-known theorem of Erdos and Posa says that a graph G has either k vertex-disjoint cycles or a vertex set X of order at most f(k) such that [email protected]?X is a forest. Starting with this result, there are many results concerning packing and covering cycles in graph theory and combinatorial optimization. In this paper, we generalize [email protected]?s result to cycles that are required to go through a set S of vertices. Given an integer k and a vertex subset S (possibly unbounded… Expand

#### Topics from this paper

Packing cycles through prescribed vertices under modularity constraints
• Mathematics, Computer Science
• Adv. Appl. Math.
• 2012
It is proved that either a graph G has k disjoint S-cycles, each of which has length divisible by p, or G has a vertex set X of order at most f(k,p) such that [email protected]?X has no such a cycle. Expand
Half-integral packing of odd cycles through prescribed vertices
• Mathematics, Computer Science
• Comb.
• 2013
This paper discusses packing disjoint S-cycles, i.e., cycles that are required to go through a set S of vertices, and shows the Erdős-Pósa-type result for the half-integral packing of odd S- cycles, which is a generalization of Reed (1999) when S=V. Expand
Disjoint cycles intersecting a set of vertices
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2012
This work considers the following generalization of the problem: fix a subset S of vertices of G, and shows that again there exists a constant c such that G either contains k disjoint S-cycles, or there is a set of at most cklogk vertices intersecting every S-cycle. Expand
Packing directed cycles through a specified vertex set
• Mathematics, Computer Science
• SODA
• 2013
The Erdos-Posa property does hold for half-integral packings of directed cycles each containing a vertex from S, i.e. where every vertex of the graph is contained in at most 2 cycles. Expand
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
• Computer Science, Mathematics
• SODA
• 2012
This paper extends both Thomassen's result and Reed's result on the Erdos-Posa theorem to cycles that are required to go through a subset of S, and gives the first fixed parameter algorithms for the two problems: the feedback set problem with respect to the S-cycles, and the cycle packing problem. Expand
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
Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs
We show the following for every sufficiently connected graph G, any vertex subset S of G, and given integer k: there are k disjoint odd cycles in G containing each a vertex of S or there is set X ofExpand
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
Packing Cycles Faster Than Erdos-Posa
• Mathematics, Computer Science
• ICALP
• 2017
This paper develops a 2^{O(k\log^2k/log log k})} |V|-time (deterministic) algorithm for Cycle Packing, and apart from beating the known bound, the algorithm runs in time linear in |V |, and its space complexity is polynomial in the input size. Expand
71 : 2 Packing Cycles Faster Than
The Cycle Packing problem asks whether a given undirected graph G = (V,E) contains k vertex-disjoint cycles. Since the publication of the classic Erdős-Pósa theorem in 1965, this problem receivedExpand

#### References

SHOWING 1-10 OF 13 REFERENCES
Disjoint cycles intersecting a set of vertices
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2012
This work considers the following generalization of the problem: fix a subset S of vertices of G, and shows that again there exists a constant c such that G either contains k disjoint S-cycles, or there is a set of at most cklogk vertices intersecting every S-cycle. Expand
On the presence of disjoint subgraphs of a specified type
• C. Thomassen
• Mathematics, Computer Science
• J. Graph Theory
• 1988
A general sufficient condition for a family of graphs to have the Erdos-Posa property is derived and a polynomially bounded algorithm for finding a cycle of length divisible by m is obtained. Expand
On the odd-minor variant of Hadwiger's conjecture
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2009
It is shown that, for every l, if a graph contains no odd K"l-expansion then its chromatic number is O(llogl), and that given a graph and a subset S of its vertex set, either there are k vertex-disjoint odd paths with endpoints in S, or there is a set X of at most 2k-2 vertices such that every odd path with both ends in S contains a vertex in X. 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 aExpand
Approximation algorithms and hardness results for cycle packing problems
• Computer Science, Mathematics
• ACM Trans. Algorithms
• 2007
A lower bound of Ω(log n/loglog n) is proved for the integrality gap of edge-disjoint cycle packing and the approximability of νe(G) in directed graphs, improving upon the previously known APX-hardness result for this problem. Expand
Graph Minors
For a given graph G and integers b, f ≥ 0, let S be a subset of vertices of G of size b + 1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G byExpand
Graph Minors .XIII. The Disjoint Paths Problem
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 1995
An algorithm, which for fixed k ≥ 0 has running time O (| V(G) | 3 ), to solve the following problem: given a graph G and k pairs of vertices of G, decide if there are k mutually vertex-disjoint paths of G joining the pairs. Expand
Packing directed circuits
• Computer Science, Mathematics
• Comb.
• 1996
It is proved that for every digraphG, either G hasn vertex-disjoint directed circuits, or G can be made acyclic by deleting at mostt vertices. Expand
A combinatorial problem in geometry
• Mathematics
• 2009
Our present problem has been suggested by Miss Esther Klein in connection with the following proposition.