Finite tournaments with a nonempty diamonds' support (Q2637718): Difference between revisions

The order of a finite tournament \(T(V,A)\) with vertex set \(V\) and arc set \(A\) is the cardinality of \(V\). There are two tournaments called diamonds on 4 vertices and containing a unique 3-cycle, up to isomorphism. If \(T(V,A)\) contains at least a diamond, the diamonds' support of \(T(V,A)\) is the intersection of all the subsets \(X\) of \(V\) such that the sub-tournament of \(T(V,A)\), induced by \(X\), is a diamond. Following the characterization of the tournaments without diamonds, the paper gives a description of the indecomposable tournaments admitting a nonempty diamonds' support, thereby completing the characterization of the tournaments whose diamonds' support is nonempty by describing the tournaments whose diamonds' support is a singleton.