Problemcore
Stable roommates problem
Also called stable roommates.
Stable matching in a non-bipartite graph where every agent ranks all others.
Stable matching in a non-bipartite graph where every agent ranks all others.
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 CAH9JF Edit this page History Report an error