Essentially disjoint families, conflict free colorings and Shelah's revised GCH

DOI10.1007/S10474-013-0298-8MaRDI QIDQ2448972zbMATH OpenOpenAlexFDO

Publication date 5 May 2014

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.1971

sparse conflict-free coloring revised GCH almost disjoint conflict-free chromatic number essentially disjoint singular cardinal compactness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05) Large cardinals (03E55) Continuum hypothesis and Martin's axiom (03E50)

Abstract: Using Shelah's revised GCH theorem we prove that if mu<beth_omega <= lambda are cardinals, then every mu-almost disjoint subfamily B of [lambda]^{beth_omega} 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<beth_omega<=lambda, then every mu-almost disjoint family B of subsets of lambda with |b|>=beth_omega for all b from B has a conflict-free colorings with beth_omega colors. To yield the above mentioned results we also need to prove a certain compactness theorem concerning singular cardinals.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Essentially disjoint families, conflict free colorings and Shelah's revised GCH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448972)