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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enumeration of indecomposable tournaments with minimum Slater index

Houmem Belkhechine, Cherifa Ben Salha, Rim Romdhane
Discrete Mathematics Algorithms and Applications
Advanced Combinatorial Mathematics
article

Enumeration of indecomposable tournaments with minimum Slater index

Houmem Belkhechine, Cherifa Ben Salha, Rim Romdhane
article en

Abstract

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.

Discrete Mathematics Algorithms and Applications
Openalex Percentile: Top 3%
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.