Coloring cross-intersecting families
The electronic journal of combinatorics, Tome 25 (2018) no. 1
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.
DOI :
10.37236/7162
Classification :
05D05
Mots-clés : hypergraphs colorings, cross-intersecting family, intersecting family
Mots-clés : hypergraphs colorings, cross-intersecting family, intersecting family
Affiliations des auteurs :
Danila Cherkashin  1
@article{10_37236_7162,
author = {Danila Cherkashin},
title = {Coloring cross-intersecting families},
journal = {The electronic journal of combinatorics},
year = {2018},
volume = {25},
number = {1},
doi = {10.37236/7162},
zbl = {1390.05232},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7162/}
}
Danila Cherkashin. Coloring cross-intersecting families. The electronic journal of combinatorics, Tome 25 (2018) no. 1. doi: 10.37236/7162
Cité par Sources :