If the paths of length ≤s, joining two non-adjacent vertices u, υ of a graph cannot be destroyed by deleting less than t vertices, then there are at least t internally vertex-disjoint paths joining u and υ, each having length less than ( t+s-2 s-2)+( t+s-3 s-2). Some constructions show that using paths of length at least s t-1t might be necessary.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics