1
vote
Accepted
All nodes with in- and out-degree >=1, means everybody is in a cycle right?
Your proof is not correct. After removing the largest cycle, it is not necessarily true that all remaining nodes have in-degree and out-degree >=1. It is easy to construct a counter-example (I ...
D.W.♦
- 164k
Only top scored, non community-wiki answers of a minimum length are eligible