4 citations · 17 across the 24 of their papers we have counts for
Showing 1999Show all
2 papers · 1 filter
math.CO1999
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.
math.CO1999★ 4 cited
Dynamic monopolies of constant size
Eli Berger
The paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of verti…