Enumeration of indecomposable tournaments with minimum Slater index
The Slater index of a tournament is the minimum number of arcs that must be reversed in that tournament to make it a total order. Let [Formula: see text] be an integer with [Formula: see text] 5. The minimum value of the Slater index over the indecomposable [Formula: see text]-vertex tournaments is [Formula: see text]. In a recent paper [H. Belkhechine, C. Ben Salha, R. Romdhane, Indecomposable tournaments with minimum Slater index, Accepted and to appear soon in Adv. Pure Appl. Math.], we characterized the indecomposable n-vertex tournaments with at least five vertices and minimum Slater index, i.e., with Slater index [Formula: see text]. In this paper, we asymptotically enumerate these tournaments.
Authors
- Houmem Belkhechine (ORCID: https://orcid.org/0000-0002-3947-3206)
- Cherifa Ben Salha (ORCID: https://orcid.org/0000-0003-1063-6603)
- Rim Romdhane (ORCID: https://orcid.org/0009-0003-2576-6635)
Publication Details
- Journal
- Discrete Mathematics Algorithms and Applications
- Published
- 2026-04-30
- DOI
- https://doi.org/10.1142/s1793830926500485
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- article
- Field-Weighted Citation Impact
- 0.00