Related papers: Tree sums of maximal connected spaces
In various articles, it is said that the class of all soft topologies on a common universe forms a complete lattice, but in this paper, we prove that it is a complete lattice. Some soft topologies are maximal and some are minimal with…
We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…
For every finite closure space $X$ one can define a finite topological space $\operatorname{Top} X$ together with a natural projection $\operatorname{Top} X\longrightarrow X$. This could allow to apply the techniques of topological…
A topological space is nonseparably connected if it is connected but all of its connected separable subspaces are singletons. We show that each connected first countable space is the image of a nonseparably connected complete metric space…
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…
We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the preferential compactness mechanism have complex…
In this paper we show that every finite spatial graph is a connected sum of a planar graph, which is a forest, i.e. disjoint union of finite number of trees and a tangle. As a consequence we get that any finite spatial graph is a connected…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…
We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…
We investigate which topological spaces can be constructed as topological realisations of higher-rank graphs. We describe equivalence relations on higher-rank graphs for which the quotient is again a higher-rank graph, and show that…
Topologies $\tau, \sigma$ on a set $X$ are called $\pi$-compatible if $\tau$ is a $\pi$-network for $\sigma$, and vice versa. If topologies $\tau, \sigma$ on a set $X$ are $\pi$-compatible then the families of nowhere dense sets (resp.…
The graph topology $\tau_{\Gamma}$ is the topology on the space $C(X)$ of all continuous functions defined on a Tychonoff space $X$ inherited from the Vietoris topology on $X\times \mathbb R$ after identifying continuous functions with…
In this paper we introduce a new technique to prove the existence of closed subspaces of maximal dimension inside sets of topological vector sequence spaces. The results we prove cover some sequence spaces not studied before in the context…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
This paper explores a new class of incomplete preferences -- termed ``connected preferences'' -- in which maximal domains of comparability are topologically connected. We provide necessary and sufficient conditions for continuous…
The topological complexity of a path-connected space $X,$ denoted $TC(X),$ can be thought of as the minimum number of continuous rules needed to describe how to move from one point in $X$ to another. The space $X$ is often interpreted as a…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. A reduced graph $G$ is said to be maximal if any reduced…
Completeness for a (topological) space is often based on the existence of special structures (such as metrics, uniformities, proximities, convergences, etc) that explicitly induce the topology, making the completeness induction-dependent.…
This paper has two parts. First, we recall and detail the definition of the Grothendieck topos of a connectivity space, that is the topos of sheaves on such a space. In the second part, we prove that every finite connectivity space is…