how do I construct np-reduction for this matching problem?

Question

I have a matching problem, which I think is np-hard:

We need to arrange a dinner for a group of n people, some of the people are friends with eachother, some