2002
DOI: 10.1016/s0166-8641(02)00004-4
|View full text |Cite
|
Sign up to set email alerts
|

On resolvability of topological spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2004
2004
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(13 citation statements)
references
References 7 publications
0
13
0
Order By: Relevance
“…Actually, this fact is obtained as a corollary of Theorem 2, which states (in one of its possible formulations) that every regular and non-trivial connected space, with a π-base consisting of connected sets, is ω-resolvable. As far as we know, our Theorem 2 and [Pav,Corollary 3.11] are the only results in the literature that show how connectedness and regularity, together with some reasonable supplementary assumptions, may entail resolvability.…”
Section: Introductionmentioning
confidence: 87%
See 1 more Smart Citation
“…Actually, this fact is obtained as a corollary of Theorem 2, which states (in one of its possible formulations) that every regular and non-trivial connected space, with a π-base consisting of connected sets, is ω-resolvable. As far as we know, our Theorem 2 and [Pav,Corollary 3.11] are the only results in the literature that show how connectedness and regularity, together with some reasonable supplementary assumptions, may entail resolvability.…”
Section: Introductionmentioning
confidence: 87%
“…A first result in this vein is attributed to Yashenko in [Pav,considerations after Corollary 3.11], where it is stated that every Tychonoff connected space is resolvable-actually, c-resolvable. In the present paper we show that the hypothesis of complete regularity in Yashenko's result may be relaxed to regularity, even if in this case we can prove only ω-resolvability.…”
Section: Introductionmentioning
confidence: 99%
“…For example, years ago Pytke ′ ev [31] showed that every k-space, also every space X for which the tightness t(X) satisfies t(X) < ∆(X), is maximally resolvable. More recently, denoting by ps(X) the smallest successor cardinal such that every discrete set S ⊆ X satisfies |S| < ps(X), Pavlov [29] showed that every T 1 -space such that ∆(X) > ps(X) is maximally resolvable. That theorem was strengthened in two ways in [26]: No separation hypothesis on X is required, and maximal resolvability of X is established assuming only ∆(X) ≥ ps(X).…”
Section: Remark 32mentioning
confidence: 99%
“…In the particular case when µ is a successor cardinal it follows from Proposition 2.1 of [12]. Lemma 3.16: If |X| = µ is a regular cardinal and T µ (X) is dense in X then X is µ-resolvable.…”
Section: Corollary 37mentioning
confidence: 99%