Bypaths in tournaments (Q1372736)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bypaths in tournaments |
scientific article; zbMATH DE number 1088859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bypaths in tournaments |
scientific article; zbMATH DE number 1088859 |
Statements
Bypaths in tournaments (English)
0 references
1 February 1998
0 references
Let \(T\) be a tournament of order \(n\). If \(T\) is 3-connected and each arc of \(T\) is contained in a cycle of length 3, then every arc of \(T\) has a bypath of length \(k\), for each \(k\) with \(3 \leq k \leq n-1\), unless \(T\) is isomorphic to two tournaments, each of which is of order 8.
0 references
tournament
0 references
bypath
0 references
pan-connectivity
0 references
0.8924769
0 references
0 references
0 references
0 references
0 references
0 references
