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 1

    Fingerprint

Keywords

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

ASJC Scopus subject areas

  • Applied Mathematics

Cite this