Abstract: Let C be a clique of a graph G. The capacity of C is dened to be (jV (G) n Cj + jDj)=2, where
D is the set of vertices in V (G) n C that have both a neighbour and a non-neighbour in C. We
give a polynomial-time algorithm to nd the minimum clique capacity in a graph G. This problem
arose as an open question in a study [1] of packing vertex-disjoint induced three-vertex paths
in a graph with no stable set of size three, which in turn was motivated by Hadwiger's
conjecture.