This article is cited 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

DOI: 10.4213/mzm10136

 English version: Mathematical Notes, 2013, 93:1, 191–195

Bibliographic databases:

• 
• 
• 
• 
• 
•