#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.
Stuck? A gentle nudge
Your working
Check your full solution
Attach photos of your pages (up to 3) or one PDF — or check what you typed above. Lemma reads the work and verifies the reasoning, not just the answer.
Your first check today doesn't need an account.
Your photos and PDFs are read once and not stored — only the transcription is kept.