Displaying similar documents to “♣-like principles under CH”

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...

Characterizing chainable, tree-like, and circle-like continua

Taras Banakh, Zdzisław Kosztołowicz, Sławomir Turek (2011)

Colloquium Mathematicae

Similarity:

We prove that a continuum X is tree-like (resp. circle-like, chainable) if and only if for each open cover 𝓤₄ = {U₁,U₂,U₃,U₄} of X there is a 𝓤₄-map f: X → Y onto a tree (resp. onto the circle, onto the interval). A continuum X is an acyclic curve if and only if for each open cover 𝓤₃ = {U₁,U₂,U₃} of X there is a 𝓤₃-map f: X → Y onto a tree (or the interval [0,1]).

Rudin's Dowker space in the extension with a Suslin tree

Teruyuki Yorioka (2008)

Fundamenta Mathematicae

Similarity:

We introduce a generalization of a Dowker space constructed from a Suslin tree by Mary Ellen Rudin, and the rectangle refining property for forcing notions, which modifies the one for partitions due to Paul B. Larson and Stevo Todorčević and is stronger than the countable chain condition. It is proved that Martin's Axiom for forcing notions with the rectangle refining property implies that every generalized Rudin space constructed from Aronszajn trees is non-Dowker, and that the same...

A characterization of (γₜ,γ₂)-trees

You Lu, Xinmin Hou, Jun-Ming Xu, Ning Li (2010)

Discussiones Mathematicae Graph Theory

Similarity:

Let γₜ(G) and γ₂(G) be the total domination number and the 2-domination number of a graph G, respectively. It has been shown that: γₜ(T) ≤ γ₂(T) for any tree T. In this paper, we provide a constructive characterization of those trees with equal total domination number and 2-domination number.

The Tree Property at ω₂ and Bounded Forcing Axioms

Sy-David Friedman, Víctor Torres-Pérez (2015)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We prove that the Tree Property at ω₂ together with BPFA is equiconsistent with the existence of a weakly compact reflecting cardinal, and if BPFA is replaced by BPFA(ω₁) then it is equiconsistent with the existence of just a weakly compact cardinal. Similarly, we show that the Special Tree Property for ω₂ together with BPFA is equiconsistent with the existence of a reflecting Mahlo cardinal, and if BPFA is replaced by BPFA(ω₁) then it is equiconsistent with the existence of just a Mahlo...

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...

A Corson compact L-space from a Suslin tree

Peter Nyikos (2015)

Colloquium Mathematicae

Similarity:

The completion of a Suslin tree is shown to be a consistent example of a Corson compact L-space when endowed with the coarse wedge topology. The example has the further properties of being zero-dimensional and monotonically normal.