Research output: Contribution to journal › Article › peer-review
Coloring cross-intersecting families. / Cherkashin, Danila.
In: Electronic Journal of Combinatorics, Vol. 25, No. 1, #P1.47, 02.03.2018.Research output: Contribution to journal › Article › peer-review
}
TY - JOUR
T1 - Coloring cross-intersecting families
AU - Cherkashin, Danila
PY - 2018/3/2
Y1 - 2018/3/2
N2 - 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.
AB - 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.
KW - Cross-intersecting family
KW - Hypergraphs colorings
KW - Intersecting family
UR - http://www.scopus.com/inward/record.url?scp=85042753536&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:85042753536
VL - 25
JO - Electronic Journal of Combinatorics
JF - Electronic Journal of Combinatorics
SN - 1077-8926
IS - 1
M1 - #P1.47
ER -
ID: 36097766