Hamiltonian dicycles avoiding prescribed arcs in tournaments (Q1090684): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q190560 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Ioan Tomescu / rank | |||
Normal rank |
Revision as of 12:05, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hamiltonian dicycles avoiding prescribed arcs in tournaments |
scientific article |
Statements
Hamiltonian dicycles avoiding prescribed arcs in tournaments (English)
0 references
1987
0 references
The main result of this paper is the following theorem: If T is a k- connected tournament and I a set of k-1 arcs of T, then T-I has a Hamiltonian directed cycle. This result was conjectured by the second author in a previous paper [Proc. Lond. Math. Soc., III. Ser. 45, 151-168 (1982; Zbl 0486.05049)].
0 references
Hamiltonian dicycle
0 references
k-connectedness
0 references
Camion's theorem
0 references
tournament
0 references