Colour refinement
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as graph isomorphism — the same set of essays touches all of them, so they are one junction rather than several.
The game the algorithm was playing
Change what Duplicator has to offer — a whole bijection instead of one element — and the game stops measuring first-order logic and starts measuring colour refinement, the algorithm every practical graph-isomorphism test begins with. Two subjects that grew apart are one game with the moves relabelled.
One gadget defeats every refinement
Colour refinement fails on two triangles against a hexagon; its two-dimensional version fixes that and fails on a pair of strongly regular graphs. For every k there are two graphs the k-dimensional version cannot separate, and they are built from one local piece whose only symmetry is a parity.
Named alongside it
The objects these essays reach for when they reach for this one.
Ehrenfeucht fraisse gameGraph isomorphismInvariantCounting argumentExhaustive searchExpressive powerParityQuantifier depth