Erdős-Pósa property of tripods in directed graphs
Marcin Briański, Meike Hatzel, Karolina Okrasa, Michał Pilipczuk
TL;DR
This work establishes the Erdős-Pósa property for tripods in directed graphs with designated sources and sinks: either there are $k$ vertex-disjoint tripods or a hitting set of size $f(k)$ meets all tripods. The authors define tripods as unions of two disjoint $S$-$c$ paths and a $c$-$t$ path sharing only the centre, and develop a robust framework combining onion structures, Ramsey-type arguments, and a separation-based Erdős-Pósa strategy. A key contribution is the construction of the hitting function $f(k)$ via $f(k)=2f(k-1)+2g(k)$, where $g(k)$ governs a packing lemma for crossing linkages; matroid intersection tools bound the cut structure, enabling the inductive proof. The paper also links tripods to directed immersions and discusses extensions to edge-disjoint tripods and to acyclic patterns such as $k$-arborescences, highlighting both potential gains and obstacles.
Abstract
Let $D$ be a directed graphs with distinguished sets of sources $S\subseteq V(D)$ and sinks $T\subseteq V(D)$. A tripod in $D$ is a subgraph consisting of the union of two $S$-$T$-paths that have distinct start-vertices and the same end-vertex, and are disjoint apart from sharing a suffix. We prove that tripods in directed graphs exhibit the Erdős-Pósa property. More precisely, there is a function $f\colon \mathbb{N}\to \mathbb{N}$ such that for every digraph $D$ with sources $S$ and sinks $T$, if $D$ does not contain $k$ vertex-disjoint tripods, then there is a set of at most $f(k)$ vertices that meets all the tripods in $D$.
