Maximizing the Cohesion is NP-hard

We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard.