![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
sniffnoyThis is a pretty simple problem, but I think it's a neat result.
Say you have a finite digraph where every vertex has indegree equal to outdegree. Then if it's connected, it's strongly connected.
It's pretty easy to prove, but it lets you see global information just from weaker global information + knowing degrees.
-Harry
Say you have a finite digraph where every vertex has indegree equal to outdegree. Then if it's connected, it's strongly connected.
It's pretty easy to prove, but it lets you see global information just from weaker global information + knowing degrees.
-Harry
