A set system X is rho-almost-disjoint iff the intersection of any
two elements of X has cardinality less than rho.
For different rho we prove theorems concerning the chromatic number,
the conflict free chromatic number or the essentially disjointness of
rho-almost disjoint set systems.
We will use large cardinals to get consistency results, and
we apply Shelah's Revised GCH Theorem to get results in ZFC.