Concept

Colour refinement

An algorithm that colours a graph's points by their degree, then by the multiset of their neighbours' colours, and repeats until nothing splits. It is the first thing every practical isomorphism test does, and it is exactly as strong as a two-pebble game — so the pairs it cannot separate are the pairs two variables cannot describe apart.

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.

Named alongside it

The objects these essays reach for when they reach for this one.

Ehrenfeucht fraisse gameGraph isomorphismInvariantCounting argumentExhaustive searchExpressive powerParityQuantifier depth

All concepts