Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

Party Games

Library Home || Full Table of Contents || Suggest a Link || Library Help

Visit this site: http://www.maa.org/mathland/mathtrek_12_6_99.html

Author:Ivars Peterson (MathTrek)
Description: 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
Languages: English
Resource Types: Articles
Math Topics: Combinatorics, Permutations/Combinations, Graph Theory

[Privacy Policy] [Terms of Use]

Home || The Math Library || Quick Reference || Search || Help

© 1994- The Math Forum at NCTM. All rights reserved.