Six points, two colors, and an unavoidable triangle
Invite any six people to a party, and a mathematical theorem guarantees that either three of them have all met each other before, or three of them are complete strangers to one another. Ramsey theory turns that party puzzle into a geometric proof: if you connect six dots with every possible line and color each line red or blue, you cannot avoid creating a single-color triangle.
Questions you could explore
- Why must one point have at least three connections of the same color?
- Can five points avoid such a triangle?
Start reading
- Ankur Moitra / MIT OpenCourseWarePrinciples of Discrete Applied Mathematics: lecture transcript on Ramsey theory, Spring 2024
The lecture turns the six-person puzzle into a graph with two kinds of links, making the mathematical assumptions explicit.
Ready to try your ideas aloud?
Your topic carries over. Record up to 2½ minutes, depending on your plan.