Related papers: Tournaments with maximal decomposability
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
A multipartite tournament is an orientation of a complete $k$-partite graph for some positive integer $k\geq 3$. We say that a multipartite tournament $D$ is tight if every partite set forms a clique in the $(1,2)$-step competition graph,…
In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…
A transitive tournament is an acyclic orientation of a complete graph. We study decompositions and packings of the transitive tournament \(TT_n\) into connected two-arc motifs. The three motifs considered are chains, colliders, and forks,…
We study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for five tournaments as well as unique extremal sequences for each tournament. As a…
We establish the essential normality of a large new class of homogeneous submodules of the finite rank d-shift Hilbert module. The main idea is a notion of essential decomposability that determines when an arbitrary submodule can be…
A homogeneous tournament is a tournament with $4t+3$ vertices such that every arc is contained in exactly $t+1$ cycles of length $3$. Homogeneous tournaments are the first class of tournaments that are proved to be path extendable, which…
P. J. Kelly conjectured in 1968 that every diregular tournament on (2n+1) points can be decomposed in directed Hamilton circuits [1]. We define so called leading diregular tournament on (2n+1) points and show that it can be decomposed in…
It is proved that an indecomposable Harish-Chandra module over the Virasoro algebra must be (i) a uniformly bounded module, or (ii) a module in Category $\cal O$, or (iii) a module in Category ${\cal O}^-$, or (iv) a module which contains…
A tournament is called locally transitive if the outneighbourhood and the inneighbourhood of every vertex are transitive. Equivalently, a tournament is locally transitive if it avoids the tournaments $W_4$ and $L_4$, which are the only…
A distinguishing $r$-labeling of a digraph $G$ is a mapping $\lambda$ from the set of verticesof $G$ to the set of labels $\{1,\dots,r\}$ such that no nontrivial automorphism of $G$ preserves all the labels.The distinguishing number $D(G)$…
We consider the following Tur\'an-type problem: given a fixed tournament $H$, what is the least integer $t=t(n,H)$ so that adding $t$ edges to any $n$-vertex tournament, results in a digraph containing a copy of $H$. Similarly, what is the…
This article deals with ranking methods. We study the situation where a tournament between $n$ players $P_1$, $P_2$, \ldots $P_n$ gives the ranking $P_1 \succ P_2 \succ \cdots \succ P_n$, but, if the results of $P_n$ are no longer taken…
A conjecture of Alon, Pach and Solymosi, which is equivalent to the celebrated Erd\H{o}s-Hajnal Conjecture, states that for every tournament $S$ there exists $\epsilon(S)>0$ such that if $T$ is an $n$-vertex tournament that does not…
The aim of this work is to show how we can decompose a module (if decomposable) into an indecomposable module with the help of the minimization process.
Let $A$ be a hereditary algebra over an algebraically closed field $k$ and $A^{(m)}$ be the $m$-replicated algebra of $A$. Given an $A^{(m)}$-module $T$, we denote by $\delta (T)$ the number of non isomorphic indecomposable summands of $T$.…
A {\em tournament} is a directed graph $T$ such that every pair of vertices is connected by an arc. A {\em feedback vertex set} is a set $S$ of vertices in $T$ such that $T - S$ is acyclic. We consider the {\sc Feedback Vertex Set} problem…
Tournaments are orientations of the complete graph, and the directed Ramsey number $R(k)$ is the minimum number of vertices a tournament must have to be guaranteed to contain a transitive subtournament of size $k$, which we denote by…
Real world tournaments are almost always intransitive. Recent works have noted that parametric models which assume $d$ dimensional node representations can effectively model intransitive tournaments. However, nothing is known about the…
Strongly chordal digraphs are included in the class of chordal digraphs and generalize strongly chordal graphs and chordal bipartite graphs. They are the digraphs that admit a linear ordering of its vertex set for which their adjacency…