L. Aurichi

Kriesell's conjecture for infinite graphs

Let $G$ be a graph and $S\subseteq V(G)$ be a subset of vertices. An $S$-Steiner tree $T$ of $G$ is a tree of $G$ which contains $S$ in its vertex set $V(T)$. Kriesell conjectured that for every $2k$-edge-connected subset $S\subseteq V(G)$ in a finite connected graph $G$, there exist $k$ pairwise edge-disjoint $S$-Stei...