Separability properties of almost-disjoint families of sets (Q2555499)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3389043
Language Label Description Also known as
default for all languages
No label defined
    English
    Separability properties of almost-disjoint families of sets
    scientific article; zbMATH DE number 3389043

      Statements

      Separability properties of almost-disjoint families of sets (English)
      0 references
      0 references
      0 references
      1972
      0 references
      Several results are proved on almost disjoint sets and many new problems are raised. Among others the authors prove the following conjecture of \textit{Hechler}: Let \(F\) be a family of infinite sets \(\{A_\alpha \}\) satisfying \(|A_{\alpha_1} \cap A_{\alpha_2}| < \aleph_0\). Assume further that the family has chromatic number \(>2\) (or does not have property \(B\)) i.e. if a set has a non-empty intersection with every \(A\), then it contains at least one of them. Then there must be two \(A\)'s which are disjoint. Further in general it is not true that there are three \(A\)'s which are pairwise disjoint.
      0 references

      Identifiers