The theorem you are referring to is likely the "Friendship Theorem," which is often discussed in the context of social networks and combinatorial mathematics. It is sometimes informally summarized as stating that in any group of people, there exist either three mutual friends or three mutual strangers. More formally, the theorem is stated in the context of graph theory.
Articles by others on the same topic
There are currently no matching articles.