Theorem on friends and strangers
In any party of 6 people, at least 3 are mutual strangers or at least 3 are acquaintances. / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Theorem on friends and strangers?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
For the friendship theorem of Paul Erdős, Alfréd Rényi, and Vera T. Sós characterizing graphs in which each two vertices have exactly one neighbor, see friendship graph.
The theorem on friends and strangers is a mathematical theorem in an area of mathematics called Ramsey theory.