Almost disjoint families on uncountable sets

cardinalscombinatoricsset-theory

Suppose that $\Gamma$ is an infinite set. Let us say that a family $\mathscr A$ of subsets of $\Gamma$ is almost disjoint, whenever for any two distinct sets $A_1, A_2\in \mathscr{A}$ the intersection $A_1\cap A_2$ has cardinality strictly less than $|\Gamma|$ and for any $A\in \mathscr{A}$ we have $|A|=|\Gamma|$.

Does there always exist an almost disjoint family of cardinality $2^{|\Gamma|}$, or at least bigger than $|\Gamma|$?

When $\Gamma$ is countable, then of course this is the case, but I have a feeling this should fail for singular cardinals.

Best Answer

From:

B. Balcar, P. Simon, On collections of almost disjoint families, Commentationes Mathematicae Universitatis Carolinae, 29 (1988), issue 4, 631-646.

enter image description here

Related Question