Combinatorics Matchings and covers 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.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | 0BYX1D7C2E |
|---|---|
| URI | m2://0BYX1D7C2E |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C69 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page 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 page is. They do not measure its truth.