The number of edges in critical strongly connected graphs

arxiv: math/9911113 · v2 · submitted 1999-11-16 · 🧮 math.CO

Ron Aharoni , Eli Berger This is my paper

classification 🧮 math.CO

keywords connectededgesnumberstronglycriticaldigraphdirectedgraphs

0 comments

read the original 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.

This paper has not been read by Pith yet.