Published online by Cambridge University Press: 03 July 2006
We give a precise description of combed trees in terms of Kelly–Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly–Mac Lane graph of a certain shape. Conversely, we show that any such Kelly–Mac Lane graph uniquely defines a combed tree. We show how to apply this to the construction of opetopes.