Essentially disjoint families, conflict free colorings and Shelah's Revised GCH
Abstract
Using Shelah's revised GCH theorem we prove that if mu<bethomega <= lambda are cardinals, then every mu-almost disjoint subfamily B of [lambda]bethomega is essentially disjoint, i.e. for each b from B there is a subset f(b) of b of size < |b| such that the family b-f(b) b in B is disjoint. We also show that if mu<=kappa<=lambda, and kappa is infinite, and (x) every mu-almost disjoint subfamily of [lambda]kappa is essentially disjoint, then (xx) every mu-almost disjoint family B of subsets of lambda with |b|>=kappa for all b from B has a conflict-free colorings with kappa colors. Putting together these results we obtain that if mu<bethomega<=lambda, then every mu-almost disjoint family B of subsets of lambda with |b|>=bethomega for all b from B has a conflict-free colorings with bethomega colors. To yield the above mentioned results we also need to prove a certain compactness theorem concerning singular cardinals.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.