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

Let $X$ be a zero-dimensional locally compact Hausdorff space not necessarily metric and $G$ a compactly generated topological group not necessarily abelian or countable. We define recurrence at a point for any continuous action of $G$ on…

A graph is $\textit{cubelike}$ if it is a Cayley graph for some elementary abelian $2$-group $\mathbb{Z}_2^n$. The core of a graph is its smallest subgraph to which it admits a homomorphism. More than ten years ago, Ne\v{s}et\v{r}il and…

Graph covers are a way to describe continuous maps (and homeomorphisms) of a Cantor set, more generally than e.g.\ Bratteli-Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by a graph cover (e.g.\…

The strong shape category of compact metrizable spaces (compacta) is very well-studied; extending it to noncompact spaces, however, introduces computational complexity that makes it hard to work with. The fine shape category, as defined by…

A graph $G$ is weakly $\gamma$-closed if every induced subgraph of $G$ contains one vertex $v$ such that for each non-neighbor $u$ of $v$ it holds that $|N(u)\cap N(v)|<\gamma$. The weak closure $\gamma(G)$ of a graph, recently introduced…

Erd\H{o}s, Harary, and Tutte defined the dimension of a graph $G$ as the smallest natural number $n$ such that $G$ can be embedded in $\mathbb{R}^n$ with each edge a straight line segment of length 1. Since the proposal of this definition,…

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…

Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a…

For $n\ge 3$, let $\Omega$ be a bounded domain in $R^n$ and $N$ be a compact Riemannian manifold in $R^L$ without boundary. Suppose that $u_n\in W^{1,n}(\Omega,N)$ are the Palais-Smale sequences of the Dirichlet $n$-energy functional and…

We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…

In this note we present some abstract ideas how one can construct spaces from building blocks according to a graph. The coupling is expressed via boundary pairs, and can be applied to very different spaces such as discrete graphs, quantum…

In the main result of the paper we extend Rosenthal's characterization of Banach spaces with the Schur property by showing that for a quasi-complete locally convex space $E$ whose separable bounded sets are metrizable the following…

The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

We obtain an internal topological characterization of the subspaces of Eberlein compacts (respectively, Corson compacts, strong Eberlein compacts, uniform Eberlein compacts, $n$-uniform Eberlein compacts).

Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…

We consider a compact metric graph of size $\varepsilon$, and attach to it several edges (leads) of length of order one (or of infinite length). As $\varepsilon$ goes to zero, the graph $\mathcal{G}^\varepsilon$ obtained in this way looks…

We introduce the notion of compactifiable classes -- these are classes of metrizable compact spaces that can be up to homeomorphic copies ``disjointly combined'' into one metrizable compact space. This is witnessed by so-called compact…

Recall that the Rado graph is the unique countable graph that realizes all one-point extensions of its finite subgraphs. The Rado graph is well-known to be universal and homogeneous in the sense that every isomorphism between finite…