Definitionintro
Maximal clique
Also called maximal complete subgraph.
A clique that is not contained in any larger clique.
A clique that is not contained in any larger clique.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag DH9MMA Edit this page History Report an error