Related papers: Connectoids I: a universal end space theory
We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
We use grid diagrams to present a unified picture of braids, Legendrian knots, and transverse knots.
After recalling the definition of connectivity spaces and some of their main properties, a way is proposed to represent finite connectivity spaces by directed simple graphs. Then a connectivity structure is associated to each tame link. It…
We study toroidal compactifications of string theories which include compactification of a timelike coordinate. Some new features in the theory of toroidal compactifications arise. Most notably, Narain moduli space does not exist as a…
In 2010, Turaev introduced knotoids as a variation on knots that replaces the embedding of a circle with the embedding of a closed interval with two endpoints which here we call poles. We define generalized knotoids to allow arbitrarily…
The notion of ends in an infinite graph $G$ might be modified if we consider them as equivalence classes of infinitely edge-connected rays, rather than equivalence classes of infinitely (vertex-)connected ones. This alternative definition…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
We present a systematic investigation into how tree-decompositions of finite adhesion capture topological properties of the space formed by a graph together with its ends. As main results, we characterise when the ends of a graph can be…
We consider the space of embeddings of finitely many circles that bound disks in non-positively curved surfaces. We index the connected components of this space with finite rooted trees and show that the connected components are classifying…
In this paper, we introduce a new graph structure, called the $direct~ sum ~graph$ on a finite dimensional vector space. We investigate the connectivity, diameter and the completeness of $\Gamma_{U\oplus W}(\mathbb{V})$. Further, we find…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…
Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
We prove that the topological cycles of an arbitrary infinite graph induce a matroid. This matroid in general is neither finitary nor cofinitary.