相关论文: End compactifications in non-locally-finite graphs
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…
A topology is defined on the mapping class group of a compact connected orientable surface. It is shown that a notion of "genericity" on subsets of the mapping class group arises from this definition. Many plausible results follow from this…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
In a series of papers, of which this is the first, we study sufficient conditions for Hamiltonicity in terms of forbidden induced subgraphs and extend such results to locally finite infinite graphs. For this we use topological circles…
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…
For locally finite infinite graphs the notion of Hamilton cycles can be extended to Hamilton circles, homeomorphic images of $S^1$ in the Freudenthal compactification. In this paper we extend some well-known theorems of the Hamiltonicity of…
Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…
We provide a well-posedness theory for a class of nonlocal continuity equations on co-evolving graphs. We describe the connection among vertices through an edge weight function and we let it evolve in time, coupling its dynamics with the…
In 1992, Diestel asked which topological spaces could be represented as the end space of some graph. In 2023, Pitz provided a solution to this question by giving a topological characterization of end spaces using a hereditarily complete…
We present a general result about generating group topologies by pseudo-norms. Namely, we show that if a topology has a base of sets which are closed in a certain sense, then it can be generated by a collection of pseudo-norms such that the…
We completely classify the locally finite, infinite graphs with pure mapping class groups admitting a coarsely bounded generating set. We also study algebraic properties of the pure mapping class group: We establish a semidirect product…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
We prove:(1) the existence, for every integer n > 3, of a noncompact smooth n-dimensional topological manifold whose diffeomorphism group contains an isomorphic copy of every finitely presented group; (2) a finiteness theorem on finite…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
We discuss in the context of finite extensions two classical theorems of Takahasi and Howson on subgroups of free groups. We provide bounds for the rank of the intersection of subgroups within classes of groups such as virtually free…
We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.
We show that the deficiency indices of the minimal Gaffney Laplacian on an infinite locally finite metric graph are equal to the number of finite volume graph ends. Moreover, we provide criteria, formulated in terms of finite volume graph…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
We construct a locally finite connected graph whose Freudenthal compactification is universal for the class of completely regular continua, a class also known in the literature under the name thin or graph-like continua.