  Conventional Ramsey-theoretic investigations for edge-colourings of complete
graphs are framed around avoidance of certain configurations. Motivated by
considerations arising in the field of Qualitative Reasoning, we explore edge
colourings that in addition to forbidding certain triangle configurations also
require others to be present. These conditions have natural combinatorial
interest in their own right, but also correspond to qualitative
representability of certain nonassociative relation algebras, which we will
call chromatic.
