IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v462y2024ics0096300323005052.html
   My bibliography  Save this article

Antidirected spanning closed trail in tournaments

Author

Listed:
  • Yang, Hong
  • Liu, Juan
  • Meng, Jixiang

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.

Suggested Citation

  • Yang, Hong & Liu, Juan & Meng, Jixiang, 2024. "Antidirected spanning closed trail in tournaments," Applied Mathematics and Computation, Elsevier, vol. 462(C).
    • Handle: RePEc:eee:apmaco:v:462:y:2024:i:c:s0096300323005052
    DOI: 10.1016/j.amc.2023.128336
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323005052
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128336?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:462:y:2024:i:c:s0096300323005052. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.