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.
- Formal statements
- 5 solved
- Erdős Problems says
- proved (Lean)
- Decision here
- No current contribution
- Checks
- 0 checks · 5 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained