Related papers: Tree sums of maximal connected spaces

A vertex of degree one in a tree is called an end vertex and a vertex of degree at least three is called a branch vertex. For a graph $G$, let $\sigma_2$ be the minimum degree sum of two nonadjacent vertices in $G$. We consider tree…

An independent edge set of graph $G$ is a matching, and is maximal if it is not a proper subset of any other matching of $G$. The number of all the maximal matchings of $G$ is denoted by $\Psi(G)$. In this paper, an algorithm to count…

The kth finite subset space of a topological space X is the space exp_k X of non-empty subsets of X of size at most k, topologised as a quotient of X^k. Using results from our earlier paper (math.GT/0210315) on the finite subset spaces of…

For a tree $T$, we show that for many positive integer values of $n$, and an integer $s \geq 2$, the higher topological complexity $TC_s$ of the unordered configuration spaces of trees $U\mathcal{C}^nT$, is maximal. In other words, we prove…

A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

Given an arbitrary spectral space $X$, we endow it with its specialization order $\leq$ and we study the interplay between suprema of subsets of $(X,\leq)$ and the constructible topology. More precisely, we investigate about when the…

We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

We construct a tree T of maximal degree 3 with infinitely many leaves such that whenever finitely many of them are removed, the remaining tree is isomorphic to T. In this sense T resembles an infinite star.

Let X and Y be oriented topological manifolds of dimension n + 2, and let K and J be connected, locally-flat, oriented, n-dimensional submanifolds of X and Y. We show that up to orientation preserving homeomorphism there is a well-defined…

The concept of $typed$ $topology$ is introduced. In a typed topological space, some open sets are assigned "types", and topological concepts such as closure, connectedness can be defined using types. A finite data set in $R^2$ is a…

Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

The Lusternik-Schnirelmann category and topological complexity are important invariants of manifolds (and more generally, topological spaces). We study the behavior of these invariants under the operation of taking the connected sum of…

In this paper it is shown how to construct a finite topological space $X$ for a given finitely presentable group $G$ such that $\pi_1(X)\cong G$. Our construction is not optimal in the sense that the cardinality of the space $X$ might not…

This paper considers the conjecture by Gr\"unbaum that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 3. Here, the co-tree of $T$ is the spanning tree of the dual…

One of the ways that connectedness has been studied through the history of topology is by using chains, the so called chain connectedness. Here we combine this notion together with continuity up to a covering to provide the inheritance of…

We consider a fixed basis of a finitely generated free chain complex as a finite topological space and we present a sufficient condition for the singular homology of this space to be isomorphic with the homology of the chain complex.

This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…