Let be a simplicial set.
The spine of an -simplex , also called its backbone, consists of the edges , , , between the successive vertices of .
When , an -horn in has the same edges as any of its fillers, so we may speak of the spine of a as well.
The above notion generalizes to dendroidal sets: the spine of a tree is the union over its corollas
For a linear tree this reproduces the above definition.
If is a Kan complex or quasi-category, then the spine of is the maximal list of composable edges (1-morphisms) of .
Similarly, if is a fibrant dendroidal set or (∞,1)-operad, the spine of a tree in is a collection of composable operations in the -operad.