Erdős problem 150
A minimal cut of a graph is a minimal set of vertices whose removal disconnects the graph. Let be the maximum number of minimal cuts a graph on vertices can have.
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:8a643ed47d11b683df7b0444744d06cd35ca6927c89b30cc11e91e04701aee19
- Metadata
- sha256:333c2e2db1ea642b92db38ec258afc6b12c9217995f7238546776e8a3fa76ece
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:0616b120138993dd2db7ee0c2ff6db83b9ba58e464a18ac6d68a9286860bfc40
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207