Vertex-disjoint paths
= Vertex-disjoint paths
<Graph paths> are vertex-disjoint if no <vertex> belongs to more than one of them, including their endpoints. In contrast, <internally vertex-disjoint paths> between common endpoints are allowed to share exactly those endpoints. The <Set version of Menger theorem> uses vertex-disjointness, while the two-terminal form uses internal vertex-disjointness.