Related papers: Graph-Like Compacta: Characterizations and Euleria…

A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most $3$ extends to an automorphism $g\in G$ of the graph, where $G$ is a group of…

A generalized topology in a set $X$ is a collection $\text{Cov}_X$ of families of subsets of $X$ such that the triple $(X,\bigcup \text{Cov}_X,\text{Cov}_X)$ is a generalized topological space in the sense of Delfs and Knebusch. In this…

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

We consider the following properties of compact oriented irreducible graph-manifolds: to contain a $\pi_1$-injective surface (immersed, virtually embedded or embedded), be (virtually) fibered over $S^1$, and to carry a metric of nonpositive…

A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection. Even though there…

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

We compactify the classical moduli variety of compact Riemann surfaces by attaching moduli of (metrized) graphs as boundary. The compactifications do not admit the structure of varieties and patch together to form a big connected moduli…

The scale of an endomorphism, $\alpha$, of a totally disconnected, locally compact group $G$ is the minimum index $[\alpha(U) : \alpha(U)\cap U]$, for $U$ a compact, open subgroup of $G$. A structural characterization of subgroups at which…

For $g\ge 2$ and $n\ge 0$, let $\mathcal{H}_{g,n}\subset \mathcal{M}_{g,n}$ denote the complex moduli stack of $n$-marked smooth hyperelliptic curves of genus $g$. A normal crossings compactification of this space is provided by the theory…

A graph is circle if there is a family of chords in a circle such that two vertices are adjacent if the corresponding chords cross each other. There are diverse characterizations of circle graphs, many of them using the notions of local…

A space is `n-arc connected' (n-ac) if any family of no more than n-points are contained in an arc. For graphs the following are equivalent: (i) 7-ac, (ii) n-ac for all n, (iii) continuous injective image of a closed sub-interval of the…

A S(n)-space is S(n)-functionally compact (S(n)FC) if every continuous function onto a S(n)-space is closed. S(n)-closed, S(n)-{\theta}-closed, minimal S(n) and S(n)FC spaces are characterized in terms of {\theta}(n)-complete accumulation…

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…

Directions of graphs were originally introduced in the study of a cops-and-robbers kind of game, while the study of end spaces has been used to generalize classical graph-theoretical results to infinite graphs, such as Halin's…

Let $G$ be a locally compact group. Then for every $G$-space $X$ the maximal $G$-proximity $\beta_G$ can be characterized by the maximal topological proximity $\beta$ as follows: $$ A \ \overline{\beta_G} \ B \Leftrightarrow \exists V \in…

We show that the categories of compact Lie groups and complex reductive groups (not necessarily connected) are homotopy equivalent topological categories. In other words, the corresponding categories enriched in the homotopy category of…

The boxicity of a graph $G$ is the minimum non-negative integer $k$ such that $G$ can be isomorphic to the intersection graph of a family of boxes in Euclidean $k$-space, where a box in Euclidean $k$-space is the Cartesian product of $k$…

Let $G$ be a graph with vertex set $V(G)$. Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$…

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

Let $G=(V,E)$ be any undirected graph on $V$ vertices and $E$ edges. A path $\textbf{P}$ between any two vertices $u,v\in V$ is said to be $t$-approximate shortest path if its length is at most $t$ times the length of the shortest path…