Inversion dans les tournois
Houmem Belkhechine, Moncef Bouaziz, Imed Boudabbous, Maurice Pouzet

TL;DR
This paper studies the inversion index of tournaments, characterizing their structure, maximum distances, and obstructions, and provides explicit descriptions and universal tournaments within these classes.
Contribution
It introduces the inversion index for tournaments, characterizes critical and $(-1)$-critical tournaments via inversions, and describes classes with bounded inversion index including obstructions and universal tournaments.
Findings
Maximum distance between tournaments is at most n-1.
Inversion index bounds for n-vertex tournaments: (n-1)/2 - log2(n) ≤ i(T) ≤ n-3.
Classes with bounded inversion index are characterized by finitely many obstructions.
Abstract
We consider the transformation reversing all arcs of a subset of the vertex set of a tournament . The \emph{index} of , denoted by , is the smallest number of subsets that must be reversed to make acyclic. It turns out that critical tournaments and -critical tournaments can be defined in terms of inversions (at most two for the former, at most four for the latter). We interpret as the minimum distance of to the transitive tournaments on the same vertex set, and we interpret the distance between two tournaments and as the \emph{Boolean dimension} of a graph, namely the Boolean sum of and . On vertices, the maximum distance is at most , whereas , the maximum of over the tournaments on vertices, satisfies , for . Let (resp.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
