Theoremcore
Structural balance theorem
Also called Heider balance theorem, Cartwright-Harary theorem.
A signed graph is balanced exactly when its nodes split into two opposing groups.
A signed graph is balanced exactly when its nodes split into two opposing groups.
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 RGF93E Edit this page History Report an error