A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Seymour's second-neighborhood conjecture
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Zeta Defense <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:counting, coloring Levels:1
Category:Combinatorics Lean version:YES! ✔
Rate this game! 4.4 out of 5 (2,459 votes)

>>> How to Play <<<
Seymour’s second-neighborhood conjecture. Proves Seymour's second-neighborhood conjecture: every nonempty finite oriented graph has a vertex with at least as many vertices at directed distance exactly two as at directed distance one. Oriented graphs may be arbitrary apart from the exclusion of loops and oppositely directed edge pairs.

>>> Level Select <<<
released 2026-09-23  |  1 theorem · 4 lemmas · 9 proofs · 6,882 words  |  PLAY LEVEL 1 »  (pdf)
We prove that every nonempty finite oriented graph has a vertex with at least as many vertices at directed distance two as at directed distance one. This resolves Seymour's second neighborhood conjecture positively.

More Combinatorics Games!
The Erdős–Gallai cycle-decomposition conjecturePower savings for polynomial-difference-free setsPower savings for planar halving lines and $k$-setsColoring and independence in graphs with forbidden subgraphs
Counterexamples to infinite matroid intersection and packing/coveringThe Friedgut–Kalai graph and hypergraph threshold conjecturesSnaky in 21 Maker moves PLAYABLE!The sharp constant in random triangle removal

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games