The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A Gowers tree like space and the space of its bounded linear operators”

Non-additivity of the fixed point property for tree-like continua

C. L. Hagopian, M. M. Marsh (2015)

Fundamenta Mathematicae

Similarity:

We investigate the fixed point property for tree-like continua that are unions of tree-like continua. We obtain a positive result if finitely many tree-like continua with the fixed point property have dendrites for pairwise intersections. Using Bellamy's seminal example, we define (i) a countable wedge X̂ of tree-like continua, each having the fpp, and X̂ admitting a fixed-point-free homeomorphism, and (ii) two tree-like continua H and K such that H, K, and H∩ K have the fixed point...

♣-like principles under CH

Winfried Just (2001)

Fundamenta Mathematicae

Similarity:

Some relatives of the Juhász Club Principle are introduced and studied in the presence of CH. In particular, it is shown that a slight strengthening of this principle implies the existence of a Suslin tree in the presence of CH.

Completely Independent Spanning Trees in (Partial) k-Trees

Masayoshi Matsushita, Yota Otachi, Toru Araki (2015)

Discussiones Mathematicae Graph Theory

Similarity:

Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such...

On the structure of path-like trees

F.A. Muntaner-Batle, Miquel Rius-Font (2008)

Discussiones Mathematicae Graph Theory

Similarity:

We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.