English
Related papers

Related papers: Topological remarks on end and edge-end spaces

200 papers

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

Combinatorics · Mathematics 2026-05-18 Oliver Bernardi , Jonathan J. Fang

If $R$ is a topological ring then $R^{\ast}$, the group of units of $R$, with the subspace topology is not necessarily a topological group. This leads us to the following natural definition: By an \emph{absolute topological ring} we mean a…

Commutative Algebra · Mathematics 2025-05-23 Abolfazl Tarizadeh

We characterize the class of infinite connected graphs $ G $ for which there exists a $ T $-join for any choice of an infinite $ T \subseteq V(G) $. We also show that the following well-known fact remains true in the infinite case. If $ G $…

Combinatorics · Mathematics 2017-04-25 Attila Joó

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

Combinatorics · Mathematics 2010-03-19 Matthias Hamann

The $k$-th symmetric product of a graph $G$ with vertex set $V$ with edge set $E$ is a graph with vertices as $k$-sets of $V$, where two $k$-sets are connected by an edge if and only if their symmetric difference is an edge in $E$. Using…

Combinatorics · Mathematics 2018-08-14 Yingkai Ouyang

In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…

Group Theory · Mathematics 2024-08-21 Parveen , Manisha , Jitender Kumar

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

Combinatorics · Mathematics 2021-12-07 G. Arunkumar , Peter J. Cameron , Rajat Kanti Nath , Lavanya Selvaganesh

We study the realization problem of finite groups as the group of homotopy classes of self-homotopy equivalences of finite spaces. Let $G$ be a finite group. Using an infinite family of pairwise non weakly homotopic asymmetric spaces we…

Algebraic Topology · Mathematics 2025-02-27 Juan Felipe Celis-Rojas

This work introduces the concept of \emph{upper-critical graphs}, in a complementary way of the conventional (lower)critical graphs: an element $x$ of a graph $G$ is called \emph{critical} if $\chi(G-x)<\chi(G)$. It is said that $G$ is a…

Combinatorics · Mathematics 2011-04-05 Jose Antonio Martin H

In this note, we consider the space $H(\Omega)^{\mathbb N}$ of sequences of holomorphic functions on an open set $\Omega\subset {\mathbb C}$. If $H(\Omega)$ is endowed with its natural topology and $H(\Omega)^{\mathbb N}$ is endowed with…

Complex Variables · Mathematics 2026-03-11 L. Bernal-González , M. C. Calderón-Moreno , J. López-Salazar , J. A. Prado-Bassas

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

Combinatorics · Mathematics 2009-10-30 Reinhard Diestel , Philipp Sprüssel

We investigate which classes of infinite graphs have the Erd\H{o}s-P\'osa property (EPP). In addition to the usual EPP, we also consider the following infinite variant of the EPP: a class $\mathcal{G}$ of graphs has the $\kappa$-EPP, where…

Combinatorics · Mathematics 2024-11-06 Thilo Krill

Let $\triangleleft$ be a relation between graphs. We say a graph $G$ is \emph{$\triangleleft$-ubiquitous} if whenever $\Gamma$ is a graph with $nG \triangleleft \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \triangleleft…

Combinatorics · Mathematics 2018-06-12 Nathan Bowler , Christian Elbracht , Joshua Erde , Pascal Gollin , Karl Heuer , Max Pitz , Maximilian Teegen

Given a connected graph $G$, the metric (resp. edge metric) dimension of $G$ is the cardinality of the smallest ordered set of vertices that uniquely identifies every pair of distinct vertices (resp. edges) of $G$ by means of distance…

Combinatorics · Mathematics 2020-06-23 Martin Knor , Snjezana Majstorovic , Aoden Teo Masa Toshi , Riste Skrekovski , Ismael G. Yero

We consider homological edge percolation on a sequence $(\mathcal{G}_t)_t$ of finite graphs covered by an infinite (quasi)transitive graph $\mathcal{H}$, and weakly convergent to $\mathcal{H}$. Namely, we use the covering maps to classify…

Mathematical Physics · Physics 2024-06-19 Michael Woolls , Leonid Pryadko

We show that there are homotopy equivalences $h:N\to M$ between closed manifolds which are induced by cell-like maps $p:N\to X$ and $q:M\to X$ but which are not homotopic to homeomorphisms. The phenomenon is based on construction of…

Geometric Topology · Mathematics 2016-05-31 A. Dranishnikov , S. Ferry , S. Weinberger

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…

Combinatorics · Mathematics 2013-09-03 Anthony Bonato , Dejan Delic

A standard combinatorial construction, due to Kontsevich, associates to any A-infinity algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We…

Quantum Algebra · Mathematics 2007-05-23 Alastair Hamilton , Andrey Lazarev

Let G be a group and let O_G denote the set of left orderings on G. Then O_G can be topologized in a natural way, and we shall study this topology to show that O_G can never be countably infinite. This paper retrieves correct parts of the…

Group Theory · Mathematics 2014-02-26 Peter A. Linnell

This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah,…

Logic · Mathematics 2016-09-06 Eric Rosen , Saharon Shelah , Scott Weinstein