Longest cycles in almost regular 3-partite tournaments (Q860458)
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 5083198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Longest cycles in almost regular 3-partite tournaments |
scientific article; zbMATH DE number 5083198 |
Statements
Longest cycles in almost regular 3-partite tournaments (English)
0 references
9 January 2007
0 references
Let \(T\) be an almost regular 3-partite tournament with \(n\) nodes. Such a tournament need not have a spanning cycle; but the author shows, among other things, that every node in such a tournament belongs to a cycle of length of at least \(n-2\) and this result is best possible.
0 references
almost regular multipartite tournaments
0 references
0 references
0 references
0.9189211
0 references
0.89178634
0 references
0.88825893
0 references
0.88825893
0 references
0.8766732
0 references
0 references
0.8359172
0 references
0 references
0.8328571
0 references
