Author

Paulo Magalhães

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

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...

L. Aurichi, Paulo Magalhães, Rodrigo Santos Monteiro · 0 citations