We prove that the maximal number of directed edges in a vertex-critical strongly connected simple digraph on n vertices is (n2) - n + 4.
Bibliographical noteFunding Information:
∗Corresponding author. E-mail addresses: firstname.lastname@example.org (R. Aharoni), email@example.com (E. Berger). 1The research was supported by the fund for the promotion of research at the Technion.
- Strongly connected digraphs
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics