We give an approximate Menger-type theorem for the case when a graph contains two − paths 1 and 2 such that 1∪2 is an induced subgraph of . More generally, we prove that there exists a function ()∈(), such that for every graph and ,⊆(), either there exist two − paths 1 and 2 such that the distance between 1 and 2 is at least , or there exists ∈() such that the ball of radius () centered at intersects every − path.