When \(n\)-cycles in \(n\)-partite tournaments are longest cycles (Q1763349)
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 2136229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | When \(n\)-cycles in \(n\)-partite tournaments are longest cycles |
scientific article; zbMATH DE number 2136229 |
Statements
When \(n\)-cycles in \(n\)-partite tournaments are longest cycles (English)
0 references
22 February 2005
0 references
\(n\)-partite tournament
0 references
Longest cycles
0 references
Short cycles
0 references
0 references
0 references
0.9320943
0 references
0.9057752
0 references
0.9037908
0 references
0 references
0.9016643
0 references
0 references
0.89360213
0 references
