Talk:Graph-theoretic properties of scales

Revision as of 07:00, 20 September 2018 by Mike Battaglia (talk | contribs) (Text replacement - "'''All discussion below is archived from the Wikispaces export in its original unaltered form.'''" to "'''All discussion below is archived from the Wikispaces export in its original unaltered form.''' <span style="color:#800000">''...)

ARCHIVED WIKISPACES DISCUSSION BELOW

All discussion below is archived from the Wikispaces export in its original unaltered form.

PLEASE MAKE ANY NEW COMMENTS ABOVE THIS SECTION. Anything below here is for archival purposes only.


Cliques

"A clique in a graph is a subgraph such that there is an edge connecting every vertex."

Maybe I am understanding this incorrectly, but shouldn't this say that there is an edge connecting every *pair* of vertices?

- Sarzadoce September 20, 2012, 04:57:10 PM UTC-0700


You are correct.

- keenanpepper September 21, 2012, 09:42:20 AM UTC-0700


Return to "Graph-theoretic properties of scales" page.