Coloring Cross-Intersecting Families

Danila Cherkashin


Intersecting and cross-intersecting families usually appear in extremal combinatorics in the vein of the Erdős-Ko-Rado theorem. On the other hand, P. Erdős and L. Lovász in their noted 1975 paper 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.


Hypergraphs colorings; Cross-intersecting family; Intersecting family

Full Text: