Conflict free colorings of (strongly) almost disjoint set-systems

András Hajnal, István Juhász, Lajos Soukup +1

A set-system $X$ is a $(\lambda ,\kappa ,\mu )$-system iff $|X|=\lambda$, $|x|=\kappa$ for each $x\in X$, and $X$ is $\mu$-almost disjoint. We write $[\lambda ,\kappa ,\mu ]->\rho$ iff every $(\lambda ,\kappa ,\mu )$-system has a "conflic…