Related papers: Topological Tournaments
A $d$-distinguishing vertex (arc) labeling of a digraph is a vertex (arc) labeling using $d$ labels that is not preserved by any nontrivial automorphism. Let $\rho(T)$ ($\rho'(T)$) be the minimum size of a label class in a 2-distinguishing…
In this paper, we study $(1,2)$-step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the $(1,2)$-step competition graph of a bipartite tournament has at…
A tournament is an orientation of a graph. Each edge represents a match, directed towards the winner. The score sequence lists the number of wins by each team. Landau (1953) characterized score sequences of the complete graph. Moon (1963)…
A family of algebras, which we call topological conjugacy algebras, is associated with each proper continuous map on a locally compact Hausdorff space. Assume that $\eta_i:\X_i\to \X_i$ is a continuous proper map on a locally compact…
To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…
Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…
Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \textit{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$ in $G$.…
We study variants of Sidorenko's conjecture in tournaments, where new phenomena arise that do not have clear analogues in the setting of undirected graphs. We first consider oriented graphs that are systematically under-represented in…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…
This paper is a survey of results and problems related to the following question: is it true that if G is a tournament with sufficiently large chromatic number, then G has two vertex-disjoint subtournaments A,B, both with large chromatic…
We consider the topological behaviors of continuous maps with one topological attractor on compact metric space $X$. This kind of map is a generalization of maps such as topologically expansive Lorenz map, unimodal map without homtervals…
We investigate tournaments with a specified score vector having additional structure: loopy tournaments in which loops are allowed, Hankel tournaments which are tournaments symmetric about the Hankel diagonal (the anti-diagonal), and…
For a continuous map on a topological graph containing a unique loop S, it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…
We provide a detailed study of topological and combinatorial properties of sectionable tournaments. This class forms an inductively constructed family of tournaments grounded over simply disconnected tournaments, those tournaments whose…
A topology on a set $X$ is the same as a projection (i.e. an idempotent linear operator) $cl:2^X\to 2^X$ satisfying $A\subset cl(A)$ for all $A\subset X$. That's a good way to summarize Kuratowski's closure operator. Basic geometry on a set…
The topological complexity ${\sf TC}(X)$ is a homotopy invariant of a topological space $X$, motivated by robotics, and providing a measure of the navigational complexity of $X$. The topological complexity of a connected sum of real…
The celebrated Erd\"{o}s-Hajnal conjecture 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 clique or…
A function $f:X\to \mathbb R$ defined on a topological space $X$ is called returning if for any point $x\in X$ there exists a positive real number $M_x$ such that for every path-connected subset $C_x\subset X$ containing the point $x$ and…
Let $E,F$ be two topological spaces and $u:E\rightarrow F$ be a map. \ If $F$ is Haudorff and $u$ is continuous, then its graph is closed. \ \ The Closed Graph Theorem establishes the converse when $E$ and $F$ are suitable objects of…
The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We…