Hamiltonian dicycles avoiding prescribed arcs in tournaments (Q1090684): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q190560 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Ioan Tomescu / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3267901 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian-connected tournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01788546 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048972313 / rank | |||
Normal rank | |||
Latest revision as of 09:52, 30 July 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
