  Twenty years ago Gromov asked about how large is the set of isomorphism
classes of groups whose systolic area is bounded from above. This article
introduces a new combinatorial invariant for finitely presentable groups called
{\it simplicial complexity} that allows to obtain a quite satisfactory answer
to his question. Using this new complexity, we also derive new results on
systolic area for groups that specify its topological behaviour.
