Related papers: Hereditary properties of tournaments

A poset P is called reversible if every order preserving bijective self map of P is an order automorphism. P is called hereditarily reversible if every subposet of P is reversible. We give a complete characterization of hereditarily…

An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is well-known that the property of recursive randomness is closed under computable permutations. We…

We prove that for every fixed $k$, the number of occurrences of the transitive tournament $Tr_k$ of order $k$ in a tournament $T_n$ on $n$ vertices is asymptotically minimized when $T_n$ is random. In the opposite direction, we show that…

We consider the problem of inferring an unknown ranking of $n$ items from a random tournament on $n$ vertices whose edge directions are correlated with the ranking. We establish, in terms of the strength of these correlations, the…

The score sequence of a tournament is the sequence of the out-degrees of its vertices arranged in nondecreasing order. The problem of counting score sequences of a tournament with $n$ vertices is more than 100 years old (MacMahon 1920). In…

A graph $G=(V,E)$ is distance hereditary if every induced path of $G$ is a shortest path. In this paper, we show that the eccentricity function $e(v)=\max\{d(v,u): u\in V\}$ in any distance-hereditary graph $G$ is almost unimodal, that is,…

Let $G = (N,E,w)$ be a weighted communication graph (with weight function $w$ on $E$). For every subset $A \subseteq N$, we delete in the subset $E(A)$ of edges with ends in $A$, all edges of minimum weight in $E(A)$. Then the connected…

A tournament is $k$-spectrally monomorphic if all the $k\times k$ principal submatrices of its adjacency matrix have the same characteristic polynomial. Transitive $n$-tournaments are trivially $k$-spectrally monomorphic. We show that there…

For an orientation $H$ with $n$ vertices, let $T(H)$ denote the maximum possible number of labeled copies of $H$ in an $n$-vertex tournament. It is easily seen that $T(H) \ge n!/2^{e(H)}$ as the latter is the expected number of such copies…

We only consider finite structures. With every totally ordered set $V$ and a subset $P$ of $\binom{V}{2}$, we associate the underlying tournament ${\rm Inv}(\underline{V}, P)$ obtained from the transitive tournament $\underline{V}:=(V,…

An equivalent directed version of the celebrated unresolved conjecture of Erdos and Hajnal proposed by Alon, Pack, and Solymosi states that for every tournament H there exists epsilon(H)>0 such that every H-free n-vertex tournament T…

We prove that isomorphism of tournaments of twin width at most $k$ can be decided in time $k^{O(\log k)}n^{O(1)}$. This implies that the isomorphism problem for classes of tournaments of bounded or moderately growing twin width is in…

The goal of property testing is to quickly distinguish between objects which satisfy a property and objects that are $\epsilon$-far from satisfying the property. There are now several general results in this area which show that natural…

We prove that there exists $C>0$ such that $\epsilon(H) \geq \frac{C}{|H|^{5}\log(|H|)}$, where $\epsilon(H)$ is the Erd\H{o}s-Hajnal coefficient of the tournament $H$, for every prime tournament $H$ for which the celebrated…

Suppose $\mathbb{F}$ is a field and let $\mathbf{a} := (a_1, a_2, \dotsc)$ be a sequence of non-zero elements in $\mathbb{F}$. For $\mathbf{a}_n := (a_1, \dotsc, a_n)$, we consider the family $\mathcal{M}_n(\mathbf{a})$ of $n \times n$…

Ladder tournaments are widely used to rank individuals in real-world organizations and games. Their mathematical properties however are still poorly understood. We formalize the ranking rule generated by a ladder tournament, and we show…

A fundamental property of choice functions is stability, which, loosely speaking, prescribes that choice sets are invariant under adding and removing unchosen alternatives. We provide several structural insights that improve our…

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…

The Erd\H{o}s-Hajnal Conjecture states that for every $H$ there exists a constant $\epsilon(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…

We show that the hereditary discrepancy of homogeneous arithmetic progressions is lower bounded by $n^{1/O(\log \log n)}$. This bound is tight up to the constant in the exponent. Our lower bound goes via proving an exponential lower bound…