2017/07/14 by Danila Cherkashin, Cherkashin, Danila
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1707.04539
6 pages
arxiv created 2017/07/14 · arxiv updated 2017/07/17
Intersecting and cross-intersecting families usually appear in extremal combinatorics in the vein of the Erd\H os--Ko--Rado theorem. On the other hand, P.~Erd\H os and L.~Lovász in the noted paper~\citeEL 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.