0 a small group of people who spend their time together and do not welcome other people into that group:
1 a small group of people who spend time together and do not want other people to join the group
The maximal strong components of this graph will be called recursive cliques.
Predicates in the same recursive clique are mutually recursive.
In this section we will define a similar concept to a red clique-cycle pair: a red corrected cycle pair.
Specify a clique embedding for the graph, and assign each edge a positive length.
We will use a clique embedding to decompose the graph.
In both cases one can use a so-called lollipop graph, where a path of suitable length extends from a clique.
Then y is no longer a celebrity, that is, a member of the celebrity clique.
In both, leadership positions are secured through election, although an examination of the recent office-holders reveals that sub-tribal cliques dominate both.
