Upper Bound in the Erd\H{o}s--Hajnal Problem of Hypergraph Coloring
Matematičeskie zametki, Tome 93 (2013) no. 1, pp. 148-151
Voir la notice de l'article provenant de la source Math-Net.Ru
Keywords:
Erdős–Hajnal problem, hypergraph coloring, Cauchy inequality, random hypergraph, $n$-homogeneous hypergraph.
@article{MZM_2013_93_1_a14,
author = {S. M. Teplyakov},
title = {Upper {Bound} in the {Erd\H{o}s--Hajnal} {Problem} of {Hypergraph} {Coloring}},
journal = {Matemati\v{c}eskie zametki},
pages = {148--151},
publisher = {mathdoc},
volume = {93},
number = {1},
year = {2013},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2013_93_1_a14/}
}
S. M. Teplyakov. Upper Bound in the Erd\H{o}s--Hajnal Problem of Hypergraph Coloring. Matematičeskie zametki, Tome 93 (2013) no. 1, pp. 148-151. http://geodesic.mathdoc.fr/item/MZM_2013_93_1_a14/