Math 2.0

concept

Clique

Summary

A clique in a graph is a set of vertices that are pairwise adjacent. Cliques are the complete subgraphs, and they appear in colouring, in Ramsey theory and in extremal graph theory. The node clique gives the precise definition.

What this node needs for W2
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Clique_(graph_theory), Definitions