Research output: Contribution to journal › Article › peer-review
Intersecting and cross-intersecting families usually appear in extremal combina- torics 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.
Original language | English |
---|---|
Article number | #P1.47 |
Journal | Electronic Journal of Combinatorics |
Volume | 25 |
Issue number | 1 |
State | Published - 2 Mar 2018 |
ID: 36097766