Homogeneity and σ-discrete sets
✍ Scribed by Ben Fitzpatrick Jr.; James M.S. White; Zhou Hao-xuan
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 328 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0166-8641
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An example of an irresolvable dense subspace of {0, 1} c is constructed in ZFC. We prove that there can be no dense maximal subspace in a product of first countable spaces, while under Booth's Lemma there exists a dense submaximal subspace in [0, 1] c . It is established that under the axiom of cons
PrCa, P., Graphs and topologies on discrete sets, Discrete Mathematics 103 (1992) 189-197. We show that a graph admits a topology on its node set which is compatible with the usual connectivity of undirected graphs if, and only if, it is a comparability graph. Then, we give a similar condition for