Problem 3
Let be a positive integer. people take part in a party. For each pair, either the two people are acquainted or they are not. What is the maximum possible number of pairs that are not acquainted but have a common acquaintance among the participants?
Step 2 of 6: Graph model
Detailed analysis
Represent people by vertices and acquaintances by edges. We seek nonedges with a common neighbor.