Packing cycles through prescribed vertices under modularity constraints

Naonori Kakimura, Ken Ichi Kawarabayashi

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The well-known theorem of Erdos-Pósa says that either a graph G has k disjoint cycles or there is a vertex set X of order at most f(k) for some function f such that G/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 present a common generalization of the following Erdos-Pósa properties: The Erdos-Pósa property for cycles of length divisible by a fixed integer p (Thomassen, 1988 [19]).The Erdos-Pósa property for S-cycles, i.e., cycles which contain a vertex of a prescribed vertex set S (Kakimura, Kawarabayashi, and Marx, 2011 [10] and Pontecorvi and Wollan, 2010 [13]). Namely, given integers k,p, and a vertex set S (whose size may not depend on k and p), we prove 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 G/X has no such a cycle.

Original languageEnglish
Pages (from-to)97-110
Number of pages14
JournalAdvances in Applied Mathematics
Volume49
Issue number2
DOIs
Publication statusPublished - 2012 Aug
Externally publishedYes

Fingerprint

Graph theory
Combinatorial optimization
Modularity
Packing
Cycle
Erdös
Vertex of a graph
Divisible
Disjoint
Integer
Combinatorial Optimization
Graph in graph theory
Covering
Theorem

Keywords

  • Disjoint cycles
  • Erdos-Pósa property
  • Even cycles
  • Feedback vertex sets

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

Packing cycles through prescribed vertices under modularity constraints. / Kakimura, Naonori; Kawarabayashi, Ken Ichi.

In: Advances in Applied Mathematics, Vol. 49, No. 2, 08.2012, p. 97-110.

Research output: Contribution to journalArticle

@article{d0dded0a2b7f45b7b86043d3013bf4fa,
title = "Packing cycles through prescribed vertices under modularity constraints",
abstract = "The well-known theorem of Erdos-P{\'o}sa says that either a graph G has k disjoint cycles or there is a vertex set X of order at most f(k) for some function f such that G/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 present a common generalization of the following Erdos-P{\'o}sa properties: The Erdos-P{\'o}sa property for cycles of length divisible by a fixed integer p (Thomassen, 1988 [19]).The Erdos-P{\'o}sa property for S-cycles, i.e., cycles which contain a vertex of a prescribed vertex set S (Kakimura, Kawarabayashi, and Marx, 2011 [10] and Pontecorvi and Wollan, 2010 [13]). Namely, given integers k,p, and a vertex set S (whose size may not depend on k and p), we prove 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 G/X has no such a cycle.",
keywords = "Disjoint cycles, Erdos-P{\'o}sa property, Even cycles, Feedback vertex sets",
author = "Naonori Kakimura and Kawarabayashi, {Ken Ichi}",
year = "2012",
month = "8",
doi = "10.1016/j.aam.2012.03.002",
language = "English",
volume = "49",
pages = "97--110",
journal = "Advances in Applied Mathematics",
issn = "0196-8858",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Packing cycles through prescribed vertices under modularity constraints

AU - Kakimura, Naonori

AU - Kawarabayashi, Ken Ichi

PY - 2012/8

Y1 - 2012/8

N2 - The well-known theorem of Erdos-Pósa says that either a graph G has k disjoint cycles or there is a vertex set X of order at most f(k) for some function f such that G/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 present a common generalization of the following Erdos-Pósa properties: The Erdos-Pósa property for cycles of length divisible by a fixed integer p (Thomassen, 1988 [19]).The Erdos-Pósa property for S-cycles, i.e., cycles which contain a vertex of a prescribed vertex set S (Kakimura, Kawarabayashi, and Marx, 2011 [10] and Pontecorvi and Wollan, 2010 [13]). Namely, given integers k,p, and a vertex set S (whose size may not depend on k and p), we prove 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 G/X has no such a cycle.

AB - The well-known theorem of Erdos-Pósa says that either a graph G has k disjoint cycles or there is a vertex set X of order at most f(k) for some function f such that G/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 present a common generalization of the following Erdos-Pósa properties: The Erdos-Pósa property for cycles of length divisible by a fixed integer p (Thomassen, 1988 [19]).The Erdos-Pósa property for S-cycles, i.e., cycles which contain a vertex of a prescribed vertex set S (Kakimura, Kawarabayashi, and Marx, 2011 [10] and Pontecorvi and Wollan, 2010 [13]). Namely, given integers k,p, and a vertex set S (whose size may not depend on k and p), we prove 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 G/X has no such a cycle.

KW - Disjoint cycles

KW - Erdos-Pósa property

KW - Even cycles

KW - Feedback vertex sets

UR - http://www.scopus.com/inward/record.url?scp=84863987993&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863987993&partnerID=8YFLogxK

U2 - 10.1016/j.aam.2012.03.002

DO - 10.1016/j.aam.2012.03.002

M3 - Article

AN - SCOPUS:84863987993

VL - 49

SP - 97

EP - 110

JO - Advances in Applied Mathematics

JF - Advances in Applied Mathematics

SN - 0196-8858

IS - 2

ER -