|
This article is cited in 6 scientific papers (total in 6 papers)
Brief Communications
Upper Bound in the Erdős–Hajnal Problem of Hypergraph Coloring
S. M. Teplyakov
Keywords:
Erdős–Hajnal problem, hypergraph coloring, Cauchy inequality, random hypergraph, $n$-homogeneous hypergraph.
Received: 12.09.2012
Citation:
S. M. Teplyakov, “Upper Bound in the Erdős–Hajnal Problem of Hypergraph Coloring”, Mat. Zametki, 93:1 (2013), 148–151; Math. Notes, 93:1 (2013), 191–195
Linking options:
https://www.mathnet.ru/eng/mzm10136https://doi.org/10.4213/mzm10136 https://www.mathnet.ru/eng/mzm/v93/i1/p148
|
Statistics & downloads: |
Abstract page: | 370 | Full-text PDF : | 187 | References: | 84 | First page: | 155 |
|