Graphs with unique maximal clumpings

A partition of the vertices of a graph is called a clumping if, for vertices in distinct partition classes, adjacency depends only on the partition classes, not on the specific vertices. We give a simple necessary and sufficient condition for a finite graph to have a unique maximal clumping. We also investigate the extent to which this and related results generalize to infinite graphs.