#1 · Combinatorics · Graph theory

A party of six

In any gathering of six people, prove that there are always three who all know one another, or three who are all mutual strangers.

~20 minWritten answer · compare with the solutionPigeonholeRamsey R(3,3)Two-colouring

Stuck? A gentle nudge

Something off?

Workspace

Your working

Check your full solution

Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.