The number of edges in critical strongly connected graphs
Abstract
We prove that the maximal number of directed edges in a vertex-critical strongly connected simple digraph on n vertices is n(n-1)/2 - n +4.
Related Researches
Submitted on 16 Nov 1999 (v1), last revised 30 Dec 1999 (this version, v2)
Updated
arXiv.org
Original Source