Antidirected spanning closed trail in tournaments

Hong Yang, Juan Liu and Jixiang Meng

Applied Mathematics and Computation, 2024, vol. 462, issue C

Abstract: Let D be a digraph with vertex set V(D) and arc set A(D). An antidirected spanning closed trail of D is a spanning closed trail in which consecutive arcs have opposite directions and each arc of D occurs at most once. If all vertices in this antidirected spanning closed trail are distinct, then the antidirected spanning closed trail is called an antidirected hamiltonian cycle. Grünbaum in 1971 conjectured that every even tournament Tn with n≥10 has an antidirected hamiltonian cycle. In 1983, Petrović proved that any even tournament with at least 16 vertices has an antidirected hamiltonian cycle, which was the best result supporting this conjecture by far. In this paper, we investigate the existence of antidirected spanning closed trails in tournaments. Moreover, we show that every tournament Tn with n≥6 has an antidirected spanning closed trail, and prove that it is optimal.

Keywords: Tournament; Transitive tournament; Antidirected Hamiltonian cycle; Antidirected spanning closed trail (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323005052
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:462:y:2024:i:c:s0096300323005052

DOI: 10.1016/j.amc.2023.128336

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().