From the pigeonhole principle to Ramsey numbers: a maths EPQ idea
A title to start from
How far can the pigeonhole principle take us, from simple puzzles to Ramsey numbers?
Why it works as an EPQ
A one-line principle leads to surprising proofs and to a famous unsolved area, so you can map exactly where elementary methods stop.
Scope and difficulty
Solid. Solid. Prove R(3, 3) = 6 and a general bound; known values of larger Ramsey numbers belong in the discussion.
The maths
Builds on these A Level topics: Proof.
You would learn:
- Graph colourings
- Ramsey numbers
- Bounds by induction
One possible plan
- Collect and prove pigeonhole results of increasing difficulty.
- Prove that any 6 people include 3 mutual friends or 3 mutual strangers, and that 5 are not enough.
- Prove an upper bound for R(m, n) by induction.
- Explain why exact values are so hard to find.
Pitfalls
- A list of puzzles with no thread.
- Claiming values of Ramsey numbers you have not checked in a reliable source.
Where to start reading
- Search for: Ramsey number R(3,3)=6 proof
- Search for: pigeonhole principle olympiad problems
Similar ideas
- Proofs that the primes never run outWhich proof that there are infinitely many primes is the most powerful, and why?
- Proving numbers are irrationalHow far can proof by contradiction take us in showing that numbers are irrational?
- Fermat's Last Theorem for n = 4Why can Fermat's Last Theorem be proved for n = 4 with school mathematics when the general case took over 350 years?
- Are some infinities bigger than others?Are some infinities bigger than others, and how convincing is Cantor's argument?
All pure maths ideas · all 93 ideas
Your EPQ must be your own work. These pages coach: ideas, structure, checklists and planning. Submitting text, proofs, code or analysis written by someone else or by an AI tool as your own is malpractice. How to use help and AI honestly.