At the next NotYASS meeting I will speak about minimal relation
algebras. The problem I want to address is the quest for a
classification theorem of these animals (which does not seem to be
forthcoming, by the way). To make things look groovy I will focus on
symmetric representable relation algebras. If this does not sound groovy
enough, these are the ones that can be thought of in terms of certain
edge-colourings of complete graphs. There will be pictures.