Related papers: Topological Tournaments

A dominating set in a directed graph is a set of vertices $S$ such that all the vertices that do not belong to $S$ have an in-neighbour in $S$. A locating set $S$ is a set of vertices such that all the vertices that do not belong to $S$ are…

In this paper, we use the theory of Riordan matrices to introduce the notion of an oriented Riordan graph. The oriented Riordan graphs are a far-reaching generalization of the well known and well studied Toeplitz oriented graphs and…

Using nonstandard analysis we define a topology on the ring of germs of functions: $(mathbb R^n,0)\rightarrow(mathbb R,0)$. We prove that this topology is absolutely convex, Hausdorff, that convergent nets of continuous germs have…

For a countable discrete space V, every nondegenerate separable C*-correspondence over c_0(V) is isomorphic to one coming from a directed graph with vertex set V. In this paper we demonstrate why the analogous characterizations fail to hold…

We prove that there exists a constant $c > 0$ such that the vertices of every strongly $c \cdot kt$-connected tournament can be partitioned into $t$ parts, each of which induces a strongly $k$-connected tournament. This is clearly tight up…

The concept of `topological right transversal' is introduced to study right transversals in topological groups. Given any right quasigroup $S$ with a Tychonoff topology $T$, it is proved that there exists a Hausdorff topological group in…

We study biased {\em orientation games}, in which the board is the complete graph $K_n$, and Maker and Breaker take turns in directing previously undirected edges of $K_n$. At the end of the game, the obtained graph is a tournament. Maker…

We prove a conjecture of Fox, Huang, and Lee that characterizes directed graphs that have constant density in all tournaments: they are disjoint unions of trees that are each constructed in a certain recursive way.

The Isbell, compact-open and point-open topologies on the set $C(X,\mathbb{R})$ of continuous real-valued maps can be represented as the dual topologies with respect to some collections $\alpha(X)$ of compact families of open subsets of a…

We consider a simple game, the $k$-regular graph game, in which players take turns adding edges to an initially empty graph subject to the constraint that the degrees of vertices cannot exceed $k$. We show a sharp topological threshold for…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…

Let $D$ be a digraph. A $k$-container of $D$ between $u$ and $v$, $C(u,v)$, is a set of $k$ internally disjoint paths between $u$ and $v$. A $k$-container $C(u,v)$ of $D$ is a strong (resp. weak) $k^{*}$-container if there is a set of $k$…

In the Directed Disjoint Paths problem ($k$-DDP), we are given a digraph $k$ pairs of terminals, and the goal is to find $k$ pairwise vertex-disjoint paths connecting each pair of terminals. Bang-Jensen and Thomassen [SIAM J. Discrete Math.…

The symmetric inverse semigroup $I(X)$ on a set $X$ is the collection of all partial bijections between subsets of $X$ with composition as the algebraic operation. We study a minimal Hausdorff inverse semigroup topologies on $I(X)$. When…

A $(0,1)$-labelling of a set is said to be {\em friendly} if approximately one half the elements of the set are labelled 0 and one half labelled 1. Let $g$ be a labelling of the edge set of a graph that is induced by a labelling $f$ of the…

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

Let $T\subset \R^{m+1}$ be a strictly convex domain bounded by a smooth hypersurface $X=\partial T$. In this paper we find lower bounds on the number of billiard trajectories in $T$ which have a prescribed intial point $A\in X$, a…

We say that a digraph $D$ is $(i,j)$-step competitive if any two vertices have an $(i,j)$-step common out-neighbor in $D$ and that a graph $G$ is $(i,j)$-step competitively orientable if there exists an $(i,j)$-step competitive orientation…

Competition graphs were created in connected to a biological model as a means of reflecting the competition relations among the predators in the food webs and determining the smallest dimension of ecological phase space. In 2011, Factor and…