Powers of Hamilton cycles in tournaments (Q923097)
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: Publication:923097 |
scientific article; zbMATH DE number 4170935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Powers of Hamilton cycles in tournaments |
scientific article; zbMATH DE number 4170935 |
Statements
Powers of Hamilton cycles in tournaments (English)
0 references
1990
0 references
Let \(T_ n\) denote a tournament with n nodes in which every node has indegree and outdegree at least \((1/4+\epsilon)n\); the authors show that such a tournament must contain the k-th power of a Hamilton cycle provided that n is sufficiently large, depending on \(\epsilon\) and k.
0 references
degrees
0 references
tournament
0 references
Hamilton cycle
0 references
0.8815704584121704
0 references
0.824015736579895
0 references
0.8093533515930176
0 references
