Coloring cross-intersecting families (Q1753012)

Summary: Intersecting and cross-intersecting families usually appear in extremal combinatorics in the vein of the Erdos-Ko-Rado theorem. On the other hand, in [in: Infinite and finite sets. To Paul Erdős on his 60th birthday. Vols. I, II, III. Amsterdam - London: North-Holland Publishing Company. 609--627 (1975; Zbl 0315.05117)], \textit{P. Erdős} and \textit{L. Lovász} posed problems on coloring intersecting families as a restriction of classical hypergraph coloring problems to a special class of hypergraphs. This note deals with the mentioned coloring problems stated for cross-intersecting families.