Related papers: End compactifications in non-locally-finite graphs

In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…

In this paper, we present finite topological type theorems for open manifolds with non-negative Ricci curvature, under almost maximal local rewinding volume. Unlike previous related research, our theorems remove the constraints of sectional…

In the dense graph limit theory, the topology of the set of graphs is defined by the distribution of the subgraphs spanned by finite number of random vertices. Vera T. S\'os proposed a question that if we consider only the number of edges…

P. Alexandroff proved that a locally compact $T_2$-space has a $T_2$ one-point compactification (obtained by adding a "point at infinity") if and only if it is non-compact. He also asked for characterizations of spaces which have one-point…

This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite…

Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

Every countable graph can be built from finite graphs by a suitable infinite process, either adding new vertices randomly or imposing some rules on the new edges. On the other hand, a profinite topological graph is built as the inverse…

We show that if a subset $\Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…

We prove that any finitely generated one ended group has linear end depth. Moreover, we give alternative proofs to theorems relating the growth of a finitely generated group to the number of its ends.

Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a…

In this article we use techniques developed by Hrushovski-Loeser to study certain metric properties of the Berkovich analytification of a finite morphism of smooth connected projective curves. In recent work, M. Temkin proved a radiality…

We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…

In this paper, we introduce topological entropy for dynamical systems generated by a single local homeomorphism (Deaconu-Renault systems). More precisely, we generalize Adler, Konheim, and McAndrew's definition of entropy via covers and…

The Local-to-Global-Principle used in the proof of convexity theorems for momentum maps has been extracted as a statement of pure topology enriched with a structure of convexity. We extend this principle to not necessarily closed maps…

We prove a version of Gromov's compactness theorem for pseudo-holomorphic curves which holds locally in the target symplectic manifold. This result applies to sequences of curves with an unbounded number of free boundary components, and in…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…