Powers of Hamilton cycles in tournaments (Q923097): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5552097 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On extremal problems of graphs and generalized graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Long paths and cycles in oriented graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments / rank | |||
Normal rank | |||
Revision as of 11:01, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Powers of Hamilton cycles in tournaments |
scientific article |
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
