The number of edges in critical strongly connected graphs
| dc.creator | Aharoni, Ron | |
| dc.creator | Berger, Eli | |
| dc.date | 1999-11-16 | |
| dc.date | 1999-12-30 | |
| dc.date.accessioned | 2026-07-07T05:31:38Z | |
| dc.date.available | 2026-07-07T05:31:38Z | |
| dc.description | 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. | |
| dc.description | 5 pages, no figures, given at the Eleventh Haifa Matrix Theory Conference 26.5.1999 Accepted at Discrete Math. v1 is the submitted version, v2 is the version after the referee's corrections. Note the main correction: the result for edge critical strongly connected graphs is already known | |
| dc.identifier | https://arxiv.org/abs/math/9911113 | |
| dc.identifier | http://arxiv.org/abs/math/9911113 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/79414 | |
| dc.subject | Combinatorics | |
| dc.title | The number of edges in critical strongly connected graphs | |
| dc.type | text |