Classic (Ramsey, $R(3,3)=6$) · Combinatorics
Ramsey, R(3,3)=6
Prove that among any six people, there are either three who all know each other, or three who are all mutual strangers.
This is a proof problem. The answer is an argument, not a number. The solution is deliberately not posted here: reading a solution you didn't fight for teaches almost nothing. On Lemma you attempt it cold, take one of the 3 progressive hints only when genuinely stuck, then compare your proof against a full walkthrough and mark yourself with the same rubric a competition coordinator would use.
Guides that use this problem
- Ramsey problems for beginners: one move, four levelsRamsey olympiad problems in order of difficulty, from six people to three colours and number puzzles. One vertex, pigeonhole its edges, then look inside.
- Extremal graph problems for beginners: the bound and the exampleAn extremal graph problem is two problems: a bound nobody can beat and an example that reaches it. How to spot one, and which vertex to pick first.
- When you can write WLOG, and when it breaks the proofWLOG is licensed by a symmetry, never by convenience. The one test that says which assumption you may make, and the cyclic trap that fails it.
- What a complete olympiad solution actually looks likeA complete solution is not a longer one. The four beats every finished proof moves through, the five gaps that quietly lose marks, and a self-check.
- How to spot a pigeonhole problem in under a minutePigeonhole is easy to understand and hard to recognise. Four signals that tell you to reach for it, and the three questions that turn a signal into boxes.
Train it on Lemma
This problem sits in the Olympiad Set: 89 proof problems (real IMO problems and the classics) with progressive hints, full walkthroughs and marking rubrics. 128 lessons, 1237 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and the paid plan opens with 3 free days.
Find your levelMore Combinatorics problems
- Mutilated chessboardClassic (mutilated chessboard) · difficulty 3/6
- Handshake lemmaClassic (handshake lemma) · difficulty 2/6
- Erdős–SzekeresClassic (Erdős–Szekeres) · difficulty 5/6
- All 89 problems →