No label defined (Q3337490)
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 3869359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3869359 |
Statements
1984
0 references
large connectivity
0 references
tournaments
0 references
path length
0 references
0.7886390089988708
0 references
0.7854179739952087
0 references
0.784296989440918
0 references
[For the entire collection see Zbl 0543.00003.] The author establishes a number of results on the existence of paths with certain properties that join prescribed vertices in a tournament of sufficiently high connectivity. In particular, he shows that if x and y are any vertices of a tournament \(T_ n\) of connectivity \(k\geq 13\) then there is a path from x to y of length m for each integer m such that \((n- 3)/(k-5)+7\leq m\leq n-1.\)
0 references