Hamiltonian dicycles avoiding prescribed arcs in tournaments (Q1090684)

From MaRDI portal
Revision as of 09:52, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    Hamiltonian dicycle
    0 references
    k-connectedness
    0 references
    Camion's theorem
    0 references
    tournament
    0 references
    0 references
    0 references