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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.