Splitting Strongly Almost Disjoint Families

DOI10.2307/2000161zbMath0619.03033OpenAlexW4246794563MaRDI QIDQ3755449

István Juhász, Saharon Shelah, Andras Hajnal

Publication date: 1986

Full work available at URL: https://doi.org/10.2307/2000161

zbMATH Keywords

chromatic numberfamily of almost disjoint setstopological set theory

Mathematics Subject Classification ID

Other combinatorial set theory (03E05)

Related Items (18)

A theorem on decomposition into compact-scattered subspaces and cardinality of topological spaces ⋮ Canonical structure in the universe of set theory. I ⋮ On the arithmetic of density ⋮ Reflexive abelian groups and measurable cardinals and full MAD families ⋮ Conflict free colorings of (strongly) almost disjoint set-systems ⋮ Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings ⋮ The extent of strength in the club filters ⋮ Splitting families of sets in ZFC ⋮ The generalized continuum hypothesis revisited ⋮ Coloring Cantor sets and resolvability of pseudocompact spaces ⋮ Minimal covering sets for infinite set systems ⋮ On the weak Freese-Nation property of complete Boolean algebras ⋮ Canonical structure in the universe of set theory. II. ⋮ INFINITE COMBINATORICS PLAIN AND SIMPLE ⋮ A remark on hereditarily nonparadoxical sets ⋮ Transversals for strongly almost disjoint families ⋮ Cofinality changes required for a large set of unapproachable ordinals below $\aleph _{\omega +1}$ ⋮ Strongly almost disjoint sets and weakly uniform bases

Cites Work

• Unnamed Item
• Families close to disjoint ones
• Färbungen großer Würfel mit bunten Wegen
• Proper forcing
• Almost-disjoint sets the dense set problem and the partition calculus
• Remarks on the Cardinality of Compact Spaces and Their Lindelof Subspaces
• Strong axioms of infinity and elementary embeddings
• On chromatic number of graphs and set-systems
• On a property of families of sets

This page was built for publication: Splitting Strongly Almost Disjoint Families