Disjoint $X$-paths in bidirected graphs

TL;DR

This paper generalizes Gallai's theorem to bidirected graphs, providing a characterization for the existence of disjoint $X$-paths and establishing an Erdős-Pósa property for such paths.

Contribution

It extends classical results on disjoint paths from undirected to bidirected graphs, offering new necessary and sufficient conditions.

Findings

Characterization of disjoint $X$-paths in bidirected graphs

A generalized condition involving graph components and vertex sets

An Erdős-Pósa type property for $X$-paths in bidirected graphs

Abstract

Let $B$ be a bidirected multigraph with signing $\sigma$, let $X$ be a set of vertices in $B$, and let $k$ be a non-negative integer. For any pair of vertex sets $S,T\subset V(B)$ satisfying $X\cap S = X\cap T$, we denote by $B_{S,T}$ the multigraph with the same vertex set as $B$ and with edge set consisting of those edges $e$ of $B$ each of whose endvertices $v$ satisfies $v\notin S\cup T$ or $v\in S\setminus T$, $\sigma(v,e)=-$ or $v\in T\setminus S$, $\sigma(v,e)=+$. We prove that $B$ admits a set of $k$ pairwise disjoint $X$-paths if and only if for any $S,T\subseteq V(B)$ with $X\cap S = X\cap T$, the inequality $\left\lvert S\cap T \right\rvert +\sum \lfloor \tfrac{1}{2} \left\lvert V(C)\cap (X\cup S\cup T) \right\rvert \rfloor \geq k$ holds where the sum is indexed by the components of $B_{S,T}$. This result is a generalization of a result of Gallai from undirected graphs to bidirected ones. Furthermore, we will deduce from this a kind of an Erd\H{o}s-P\'osa property for $X$-paths in bidirected multigraphs.