相关论文: Tournaments with maximal decomposability

A tournament is an orientation of a complete graph. We say that a vertex $x$ in a tournament $\vec T$ controls another vertex $y$ if there exists a directed path of length at most two from $x$ to $y$. A vertex is called a king if it…

Single-elimination (SE) tournaments are a popular format used in competitive environments and decision making. Algorithms for SE tournament manipulation have been an active topic of research in recent years. In this paper, we initiate the…

We present a new problem called the incomplete Traveling Tournament problem, which introduces the well known Traveling Tournament Problem into the realm of incomplete round-robin tournaments. We focus on the case where teams can face each…

Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…

Given a tournament $T$, the problem MaxCT consists of finding a maximum (arc-disjoint) cycle packing of $T$. In the same way, MaxTT corresponds to the specific case where the collection of cycles are triangles (i.e. directed 3-cycles).…

A vertex $x$ in a tournament $T$ is called a king if for every vertex $y$ of $T$ there is a directed path from $x$ to $y$ of length at most 2. It is not hard to show that every vertex of maximum out-degree in a tournament is a king.…

Let $\mathcal{M}$ be a separable von Neumann algebra with center $\mathcal{Z}(\mathcal{M})$. An operator $T$ in $\mathcal{M}$ is called irreducible if the von Neumann algebra $W^*(T)$ generated by $T$ has trivial relative commutant, i.e.,…

We consider in this paper the family of triples $(V, T, U),$ where $ V$ is a finite dimensional space, $T $ is a nilpotent linear operator on $V$ and $U $ is an invariant subspace of $T$. Denote $[U]= ker(T_{|U})$, and $n_U= dim([U] )$. Our…

The converse of a tournament is obtained by reversing all arcs. If a tournament is isomorphic to its converse, it is called self--converse. Eplett provided a necessary and sufficient condition for a sequence of integers to be realisable as…

K\"uhn and Osthus conjectured in 2013 that regular tripartite tournaments are decomposable into Hamilton cycles. Somewhat surprisingly, Granet gave a simple counterexample to this conjecture almost 10 years later. In this paper, we show…

A tournament on 8 or more vertices may be intrinsically linked as a directed graph. We begin the classification of intrinsically linked tournaments by examining their score sequences. While many distinct tournaments may have the same score…

A celebrated unresolved conjecture of Erd\H{o}s and Hajnal states that for every undirected graph $H$ there exists $\epsilon(H)>0$ such that every undirected graph on $n$ vertices that does not contain $H$ as an induced subgraph contains a…

For a finite tensor category $\mathcal C$ and a Hopf monad $T:\mathcal C\to \mathcal C$ satisfying certain conditions we describe exact indecomposable left $\mathcal C^T$-module categories in terms of left $\mathcal C$-module categories and…

We study a high-dimensional analog for the notion of an acyclic (aka transitive) tournament. We give upper and lower bounds on the number of $d$-dimensional $n$-vertex acyclic tournaments. In addition, we prove that every $n$-vertex…

Motivated by known results for finite tournaments, we define and study the score functions of tournament kernels and the degree distributions of tournament limits. Our main theorem completely characterises those distributions that appear as…

Let $\mathcal{S}$ be a commutative semigroup, and let $T$ be a sequence of terms from the semigroup $\mathcal{S}$. We call $T$ an (additively) {\sl irreducible} sequence provided that no sum of its some terms vanishes. Given any element $a$…

The Erd\H{o}s-Hajnal conjecture states that for every given undirected graph $H$ there exists a constant $c(H)>0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique or a stable set of size at least…

The R\'{e}nyi $\alpha$-entropy $H_{\alpha}$ of complete antisymmetric directed graphs (i.e., tournaments) is explored. We optimize $H_{\alpha}$ when $\alpha = 2$ and $3$, and find that as $\alpha$ increases $H_{\alpha}$'s sensitivity to…

Maximality of a contractive tuple of operators is considered. Characterization of a contractive tuple to be maximal is obtained. Notion of maximality of a submodule of Drury-Arveson module on the $d$-dimensional unit ball $\mathbb{B}_d$ is…

We propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix of maximal row rank without columns of zeros, we associate a symmetric whole…