The number of edges in critical strongly connected graphs

Ron Aharoni, Eli Berger

Research output: Contribution to journalArticlepeer-review


We prove that the maximal number of directed edges in a vertex-critical strongly connected simple digraph on n vertices is (n2) - n + 4.

Original languageEnglish
Pages (from-to)119-123
Number of pages5
JournalDiscrete Mathematics
Issue number1-3
StatePublished - 6 May 2001
Externally publishedYes

Bibliographical note

Funding Information:
∗Corresponding author. E-mail addresses: [email protected] (R. Aharoni), [email protected] (E. Berger). 1The research was supported by the fund for the promotion of research at the Technion.


  • Strongly connected digraphs
  • Vertex-critical

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'The number of edges in critical strongly connected graphs'. Together they form a unique fingerprint.

Cite this