Problemresearch
Sparsest cut problem
Also called uniform sparsest cut, edge expansion problem.
Minimize the ratio of cut capacity to the product of the sides' sizes.
Minimize the ratio of cut capacity to the product of the sides' sizes.
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 4CAH3A Edit this page History Report an error