Related papers: Topological Tournaments
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…
Toric varieties are a special class of rational varieties defined by equations of the form {\it monomial = monomial}. For a good brief survey of the history and role of toric varieties see [10]. Any toric variety $X$ contains a cover by…
A translation structure on a surface is an atlas of charts to the plane so that the transition functions are translations. We allow our surfaces to be non-compact and infinite genus. We endow the space of all pointed surfaces equipped with…
A non-empty subset $S$ of the vertices of a digraph $D$ is called a {\it safe set} if \begin{itemize} \item[(i)] for every strongly connected component $M$ of $D-S$, there exists a strongly connected component $N$ of $D[S]$ such that there…
We study the typical structure of oriented graphs and digraphs that do not contain a blow-up T_{r+1}^t of a transitive tournament. For any integers r >= 2, t >= 1 and any real a in (3/2,2], we prove that almost all T_{r+1}^t-free oriented…
A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a…
Let T be a C^2-expanding self-map of a compact, connected, smooth, Riemannian manifold M. We correct a minor gap in the proof of a theorem from the literature: the set of points whose forward orbits are nondense has full Hausdorff…
Let $f : X\to X$ be a dominating meromorphic map on a compact K\"ahler manifold $X$ of dimension $k$. We extend the notion of topological entropy $h^l_{\mathrm{top}}(f)$ for the action of $f$ on (local) analytic sets of dimension $0\leq l…
A celebrated unresolved conjecture of Erd\"{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…
A king in a directed graph is a vertex $v$ such that every other vertex is reachable from $v$ via a path of length at most $2$. It is well known that every tournament (a complete graph where each edge has a direction) has at least one king.…
Let $X$ be a universal (Urysohn) space. We prove that every topological fractal is homeomorphic (isometric) to the attractor $A_{\mathcal F}$ of a function system ${\mathcal F}$ on $X$ consisting of Rakotch contractions.
The Bermond-Thomassen conjecture states that, for any positive integer $r$, a digraph of minimum out-degree at least $2r-1$ contains at least $r$ vertex-disjoint directed cycles. Bessy, Sereni and Lichiardopol proved that a regular…
A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…
A directed graph $G$ is $\textit{intrinsically linked}$ if every embedding of that graph contains a non-split link $L$, where each component of $L$ is a consistently oriented cycle in $G$. A $\textit{tournament}$ is a directed graph where…
Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other restrictions simple drawings do not universally exist. For…
A tournament is a directed graph T such that every pair of vertices are connected by an arc. A feedback vertex set is a set S of vertices in T such that T - S is acyclic. In this article we consider the Feedback Vertex Set problem in…
Let $X$ be a compact toric variety. Let $Hol$ denote the space of based holomorphic maps from $CP^1$ to $X$ which lie in a fixed homotopy class. Let $Map$ denote the corresponding space of continuous maps. We show that $Hol$ has the same…
Several possible definitions of local injectivity for a homomorphism of an oriented graph $G$ to an oriented graph $H$ are considered. In each case, we determine the complexity of deciding whether there exists such a homomorphism when $G$…
In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…
A tournament is an orientation of a graph. Vertices are players and edges are games, directed away from the winner. Kannan, Tetali and Vempala and McShine showed that tournaments with given score sequence can be rapidly sampled, via simple…