We consider the transformation reversing all arcs of a subset $X$ of the
vertex set of a tournament $T$. The \emph{index} of $T$, denoted by $i(T)$, is
the smallest number of subsets that must be reversed to make $T$ acyclic. It
turns out that critical tournaments and $(-1)$-critical tournaments can be
defined in terms of inversions (at most two for the former, at most four for
the latter). We interpret $i(T)$ as the minimum distance of $T$ to the
transitive tournaments on the same vertex set, and we interpret the distance
between two tournaments $T$ and $T'$ as the \emph{Boolean dimension} of a
graph, namely the Boolean sum of $T$ and $T'$. On $n$ vertices, the maximum
distance is at most $n-1$, whereas $i(n)$, the maximum of $i(T)$ over the
tournaments on $n$ vertices, satisfies $\frac {n-1}{2} - \log_{2}n \leq i(n)
\leq n-3$, for $n \geq 4$. Let $ \mathcal{I}_{m}^{< \omega}$ (resp.
$\mathcal{I}_{m}^{\leq \omega}$) be the class of finite (resp. at most
countable) tournaments $T$ such that $i(T) \leq m$. The class $\mathcal
{I}_{m}^{< \omega}$ is determined by finitely many obstructions. We give a
morphological description of the members of $\mathcal {I}_{1}^{< \omega}$ and a
description of the critical obstructions. We give an explicit description of an
universal tournament of the class $\mathcal{I}_{m}^{\leq \omega}$.Comment: 6 page
Abstract. We consider a tournament T = (V, A). For each subset X of V is associated the subtournament T (X) = (X, A∩(X ×X)) of T induced by X. We say that a tournament T ′ embeds into a tournament T when T ′ is isomorphic to a subtournament of T . Otherwise, we say that T omits T ′ . A subset X of V is a clan of T provided that for a, b ∈ X and x ∈ V \X, (a, x) ∈ A if and only if (b, x) ∈ A. For example, ∅, {x}(x ∈ V ) and V are clans of T , called trivial clans. A tournament is indecomposable if all its clans are trivial. In 2003, B. J. Latka characterized the class T of indecomposable tournaments omitting a certain tournament W 5 on 5 vertices. In the case of an indecomposable tournament T , we will study the set W 5 (T ) of vertices x ∈ V for which there exists a subset X of V such that x ∈ X and T (X) is isomorphic to W 5 . We prove the following: for any indecomposable tournamentBy giving examples, we also verify that this statement is optimal.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.