Theoremcore
Almost all graphs are asymmetric
Also called Erdős-Rényi asymmetry theorem.
For random graphs G(n,1/2) the probability of being asymmetric tends to 1 as n grows.
For random graphs G(n,1/2) the probability of being asymmetric tends to 1 as n grows.
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 VJYCP9 Edit this page History Report an error