A conjecture concerning strongly connected graphs (Q1301281)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1331733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A conjecture concerning strongly connected graphs |
scientific article; zbMATH DE number 1331733 |
Statements
A conjecture concerning strongly connected graphs (English)
0 references
9 April 2000
0 references
Let \(G\) be a strongly connected digraph without loops and multiple arcs such that \(G\) has \(n\) vertices and \(d\) arcs. It is shown in the paper that if \(n\leq 5\) and \(d\geq n(n-1)/2+1\) then there is a vertex \(v\) in \(G\) so that \(G-v\) is strongly connected as well. It is conjectured that the statement is true for any \(n\).
0 references
strongly connected digraph
0 references
0.8044031858444214
0 references
0.7766335606575012
0 references
