Pancyclic orderings of in-tournaments (Q1613377): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:03, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pancyclic orderings of in-tournaments |
scientific article |
Statements
Pancyclic orderings of in-tournaments (English)
0 references
29 August 2002
0 references
Let \(D\) denote a strong in-tournament with \(n\geq 3\) vertices, such that each vertex has at least \((3n- 3)/8\) arcs directed towards it. The author shows, among other things, that there is an ordering of the vertices such that the digraph determined by the first \(t\) vertices in this ordering is Hamiltonian, for \(t= 3,4,\dots,n\). The lower bound is sharp.
0 references
digraph
0 references
Hamiltonian
0 references
bound
0 references