Patterns of ESS's. II.

For symmetric matrix conflicts with aij = +/- 1 and aii = 0, an ESS corresponds to a clique in an associated graph. This result is proved and exploited to yield results on the attainable patterns for this class of conflicts and bounds for the number of ESS's which may coexist. Randomly generated matrices in this class are considered, and some results on the size of the support of a typical ESS given.