In a company of n persons, each person has no more than d acquaintances, and in that company there exists a group of k persons, k≥d, who are not acquainted with each other. Prove that the number of acquainted pairs is not greater than [4n2]. combinatorics proposedcombinatorics