I am familiar with the usual definition of simplicial complex or abstract simplicial complex. However, while reading Lyndon and Schupp's Combinatorial Group Theory, p. 117, the following statement is made:
If $G = (X;R)$ is the multiplication table presentation in which every element of R has length 3, then every face of $K = K(X;R)$ is a triangle and K is simplicial.
Where K is the usual complex associated to a group presentation.
My question: How is K simplicial when it only has a single vertex? The usual definitions for simplicial complexes define it in terms of subsets of the powerset of the vertex set, subject to some constraints. But this doesn't work if the vertex set is a singleton! Is there a standard rigorous alternative definition used in combinatorial group theory?
Edit for Clarification (Lyndon and Schupp's definition of the complex K):
With every presentation $G = (X,R)$ where all r in R are cyclically reduced we associate a special complex $K(X;R)$ with a single vertex. First, K has a single vertex v, and an edge $\tilde{x}$ (from v to v) for each element x of X, together with its inverse $\tilde{x}^{-1}$. Now every path in K is a loop. Second, if $r = x_1^{e_1} \cdot \cdot \cdot x_n^{e_n}$ is in R where all $x_i \in X$, $e_i = \pm 1$, we introduce a face $D$ with boundary path (at v) $\tilde{x}_1^{e_1} \cdot \cdot \cdot \tilde{x}_n^{e_n}$, together with $D^{-1}$.