PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 6, 2026Discrete Mathematics Algorithms and Applications0 citations

Enumeration of indecomposable tournaments with minimum Slater index

View Full Paper
HBHoumem BelkhechineCSCherifa Ben SalhaRRRim Romdhane

Key Points

  • The aim is to enumerate indecomposable tournaments characterized by their minimum Slater index.
  • Asymptotic enumeration of n-vertex tournaments
  • Characterization based on Slater index conditions
  • Identify minimum Slater index for indecomposable tournaments
  • Explore structural properties of these tournaments

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Belkhechine et al. (2026) studied this question.

synapsesocial.com/papers/69faa2b504f884e66b533572https://doi.org/10.1142/s1793830926500485
Ask AI
Helpful
Bookmark
Share
View Full Paper