Related papers: A subbase property for describing edge-end spaces
Our main problem is to find finite topological spaces to within homeomorphism, given (also to within homeomorphism) the quotient-spaces obtained by identifying one point of the space with each one of the other points. In a previous version…
This paper introduces and demonstrates a computational pipeline for the statistical analysis of shape graph datasets, namely geometric networks embedded in 2D or 3D spaces. Unlike traditional abstract graphs, our purpose is not only to…
We introduce the Plaque Topology on the inverse limit of a branched covering self-map of a Riemann surface of a finite degree greater than one. We present the notions of regular and irregular points in the setting of this Plaque Inverse…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes…
An algebraization of the notion of topology has been proposed more than seventy years ago in a classical paper by McKinsey and Tarski. However, in McKinsey and Tarski's setting the model theoretical notion of homomorphism does not…
For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees. In this paper, we study extremal problems of finding the…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…
We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.
Using geodesic length functions, we define a natural family of real codimension 1 subvarieties of Teichm\"uller space, namely the subsets where the lengths of two distinct simple closed geodesics are of equal length. We investigate the…
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
The concept of $typed$ $topology$ is introduced. In a typed topological space, some open sets are assigned "types", and topological concepts such as closure, connectedness can be defined using types. A finite data set in $R^2$ is a…
A drawing of a graph in the plane is a thrackle if every pair of edges intersects exactly once, either at a common vertex or at a proper crossing. Conway's conjecture states that a thrackle has at most as many edges as vertices. In this…
We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove…
It is important to classify covering subgroups of the fundamental group of a topological space using their topological properties in the topologized fundamental group. In this paper, we introduce and study some topologies on the fundamental…
We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…