Related papers: Closed graph property in Alexandroff spaces

We specify a result of Yokoi \cite{yo} by proving that if $G$ is an abelian group and $X$ is a homogeneous metric $ANR$ compactum with $\dim_GX=n$ and $\check{H}^n(X;G)\neq 0$, then $X$ is an $(n,G)$-bubble. This implies that any such space…

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

A class of graphs $\mathcal{C}$ is closed under powers if for every graph $G\in\mathcal{C}$ and every $k\in\mathbb{N}$, $G^k\in\mathcal{C}$. Also $\mathcal{C}$ is strongly closed under powers if for every $k\in\mathbb{N}$, if…

Let Y be an absolute neighborhood retract (ANR) for the class of metric spaces and let X be a Hausdorff space. Let map(X,Y) denote the space of continuous maps from X to Y with the compact open topology. It is shown that if X is a CW…

Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…

The topology of a space $X$ is generated by a family $\mathcal{C}$ of its subsets provided that a set $A\subseteq X$ is closed in $X$ if and only if $A\cap C$ is closed in $C$ for each $C\in \mathcal{C}$. A space $X$ is a $k$-space…

For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…

A topological group $X$ is called connected if the only subsets which are both open and closed are the whole space $X$ and the null set $\emptyset$. A subset of a topological group is connected if the subspace is connected. We say that a…

A class of graphs closed under taking induced subgraphs is $\chi$-bounded if there exists a function $f$ such that for all graphs $G$ in the class, $\chi(G) \leq f(\omega(G))$. We consider the following question initially studied in [A.…

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

Let $f: X \to Y$ be a regular covering of a surface $Y$ of finite type with nonempty boundary, with finitely-generated (possibly infinite) deck group $G$. We give necessary and sufficient conditions for an integral homology class on $X$ to…

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

The closure of a graph $G$ is the graph $G^*$ obtained from $G$ by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least $n$, where $n$ is the number of vertices of $G$. The well-known Closure Lemma…

We study closed three-dimensional Alexandrov spaces with a lower Ricci curvature bound in the $\mathsf{CD}^*(K,N)$ sense, focusing our attention on those with positive or nonnegative Ricci curvature. First, we show that a closed…

The free topological vector space $V(X)$ over a Tychonoff space $X$ is a pair consisting of a topological vector space $V(X)$ and a continuous map $i=i_{X}: X\rightarrow V(X)$ such that every continuous mapping $f$ from $X$ to a topological…

We consider a random walk on a discrete connected graph having some infinite branches plus finitely many vertices with finite degrees. We find the generator of a strong stationary dual in the sense of Fill, and use it to find some…

For simple graphs $X$ and $Y$ on $n$ vertices, the friends-and-strangers graph $\mathsf{FS}(X,Y)$ is the graph whose vertex set consists of all bijections $\sigma: V(X) \to V(Y)$, where two bijections $\sigma$ and $\sigma'$ are adjacent if…

Let $f\colon X\to Y$ be a perfect map between finite-dimensional metrizable spaces and $p\geq 1$. It is shown that the space $C^*(X,\R^p)$ of all bounded maps from $X$ into $\R^p$ with the source limitation topology contains a dense…

A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove…

In skew-product systems with contractive factors, all orbits asymptotically approach the graph of the so-called sync function; hence, the corresponding regularity properties primarily matter. In the literature, sync function Lipschitz…