Note on the hardness of generalized connectivity

Let G be a nontrivial connected graph of order n and let k be an integer with 2 k n . For a set S of k vertices of G , let ( S ) denote the maximum number of edge-disjoint trees T 1, T 2, , T in G ...