Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
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.
Язык оригинала | английский |
---|---|
Номер статьи | #P1.47 |
Журнал | Electronic Journal of Combinatorics |
Том | 25 |
Номер выпуска | 1 |
Состояние | Опубликовано - 2 мар 2018 |
ID: 36097766