Library Home || Full Table of Contents || Library Help
|Ivars Peterson (MathTrek)|
|You're one of six people at a dinner party. You would undoubtedly find that the dinner party includes either a group of at least three people who all know one another or a group of at least three people who don't know one another. The reason for this certainty lies in a mathematical proof that any gathering of six people will always automatically include one or the other of these two groupings. No such guarantee is possible when five or fewer people are present... A discussion of Ramsey theory, with illustrative graphs.|
|Levels:||High School (9-12), College|
|Math Topics:||Combinatorics, Permutations/Combinations, Graph Theory|
© 1994- The Math Forum at NCTM. All rights reserved.