Hamiltonian dicycles avoiding prescribed arcs in tournaments (Q1090684)
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:1090684 |
scientific article; zbMATH DE number 4008421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian dicycles avoiding prescribed arcs in tournaments |
scientific article; zbMATH DE number 4008421 |
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
0.8490520715713501
0 references
0.8485029339790344
0 references
0.8418839573860168
0 references
0.8006036281585693
0 references
