The number of edges in critical strongly connected graphs

Ron Aharoni, Eli Berger

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.