The Erdős–Pósa property for edge-disjoint immersions in 4-edge-connected graphs

Naonori Kakimura, Ken ichi Kawarabayashi

研究成果: Article査読

2 被引用数 (Scopus)


A graph H is immersed in a graph G if the vertices of H are mapped to distinct vertices of G, and the edges of H are mapped to paths joining the corresponding pairs of vertices of G, in such a way that the paths are pairwise edge-disjoint. In this paper, we show that the Erdős–Pósa property holds for packing edge-disjoint Kt-immersions in 4-edge-connected graphs. More precisely, for positive integers k and t, there exists a constant f(k,t) such that a 4-edge-connected graph G has either k edge-disjoint Kt-immersions, or an edge subset F of size at most f(k,t) such that G−F has no Kt-immersion. The 4-edge-connectivity in this statement is best possible in the sense that 3-edge-connected graphs do not have the Erdős–Pósa property.

ジャーナルJournal of Combinatorial Theory. Series B
出版ステータスPublished - 2018 7月

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 離散数学と組合せ数学
  • 計算理論と計算数学


「The Erdős–Pósa property for edge-disjoint immersions in 4-edge-connected graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。