Did you know that two different graphs with 81 vertices and 20 edges/vertex are famous enough to have Wikipedia articles?

The strongly regular Brouwer–Haemers graph (en.wikipedia.org/wiki/Brouwer%) connects elements of GF(81) that differ by a fourth power.

The Sudoku graph (en.wikipedia.org/wiki/Sudoku_g) connects cells of a Sudoku grid that should be unequal. Sudoku puzzles are instances of precoloring extension on this graph.

Unfortunately the natural graphs on the 81 cards of Set have degree ≠ 20...

A Mastodon instance for maths people. The kind of people who make $\pi z^2 \times a$ jokes.

Use $ and $ for inline LaTeX, and $ and $ for display mode.