Existence of vertices of local connectivity \(k\) in digraphs of large outdegree (Q1906850): Difference between revisions
From MaRDI portal
Latest revision as of 09:21, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Existence of vertices of local connectivity \(k\) in digraphs of large outdegree |
scientific article |
Statements
Existence of vertices of local connectivity \(k\) in digraphs of large outdegree (English)
0 references
30 May 1996
0 references
The author proves that for every positive integer \(k\) there exists a positive integer \(f(k)\) such that every finite digraph of minimum outdegree \(f(k)\) contains vertices \(x\), \(y\) connected by \(k\) openly disjoint paths from \(x\) to \(y\). This problem was given in a previous paper.
0 references
connectivity
0 references
digraph
0 references
outdegrees
0 references
openly disjoint paths
0 references