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.
Erdős Problems records this as proved (Lean).
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal5 retained
- Resolutionproved (Lean)
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingWork
Nothing here has checked that finding.
Reproducing it here turns a report into evidence.
Where the source files it274 share a topic
None carries a Standing. Browse the topic.