





















Abstract:Menger's theorem on $A$--$B$-paths and Gallai's theorem on $A$-paths are among the most useful results in structural graph theory. Many variants and extensions are known. We add to this line of research and prove results that relate the maximal number of vertex-disjoint paths between vertex sets and a wall to the minimum number of vertices meeting all these paths. We also include types of paths that start and end in the wall.
From: Felix Joos [view email]
[v1]
Mon, 22 Jun 2026 10:08:35 UTC (24 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。