An extremal connectivity parameter of tournaments (Q1587602)
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 1538204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extremal connectivity parameter of tournaments |
scientific article; zbMATH DE number 1538204 |
Statements
An extremal connectivity parameter of tournaments (English)
0 references
3 December 2000
0 references
The authors show, for each positive integer \(k\), that any sufficiently large tournament can be transformed into a \(k\)-connected tournament by the push operation, that is, by reversing the orientation of all arcs with one end in some subset of nodes of the tournament.
0 references
connectivity
0 references
tournament
0 references
push operation
0 references
0.7998515367507935
0 references
0.7975305318832397
0 references
0.7696513533592224
0 references
0.7637088894844055
0 references
0.7607783079147339
0 references
