A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Counterexamples to Sidorenko's conjecture and the forcing conjecture
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Hamilton's Revenge <<<

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.0 out of 5 (624 votes)

>>> How to Play <<<
Counterexamples to Sidorenko’s conjecture and the forcing conjecture. Disproves Sidorenko's conjecture with a connected bipartite pattern on 35 vertices and 66 edges that occurs less frequently than in a random graph of the same edge density. The same pattern disproves the forcing conjecture of Skokan and Thoma: matching its density and the edge density of a constant graphon need not force quasirandomness.

>>> Level Select <<<
released 2026-09-23  |  1 theorem · 21 lemmas · 30 proofs · 21,832 words  |  PLAY LEVEL 1 »  (pdf)
We disprove Sidorenko's conjecture with a bipartite graph on 35 vertices and 66 edges: its homomorphism density in some finite simple graph is smaller than the conjectured lower bound. The same connected graph also disproves the forcing conjecture: at one fixed density, asymptotically matching the edge and pattern densities does not imply quasirandomness.

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