Consider a social network. The goal is to find in the in the network a largest group of people who are all friends with each other.
This is the Maximum Clique problem, one of the canonical NP-complete problems. On general graphs it probably cannot be solved efficiently, though social networks, with their very particular structures, may lend themselves to more efficient solutions.