RUS
ENG
Full version
JOURNALS
// Itogi Nauki i Tekhniki. Sovremennaya Matematika i ee Prilozheniya. Tematicheskie Obzory
// Archive
Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz.,
2018
Volume 150,
Pages
26–39
(Mi into328)
This article is cited in
2
papers
On
$3$
-Homogeneous Hypergraphs Colorings in
$3$
Colors
I. A. Akolzin
Moscow Institute of Physics and Technology (State University)
Abstract:
The value
$m(n,r)$
in the Erdős–Hajnal problem is studied. Using various methods, we obtain the estimate
$27 \leq m(3,3) \leq 35$
.
Keywords:
hypergraph, coloring, combinatorics.
UDC:
519.17
MSC:
05D99
Fulltext:
PDF file (238 kB)
References
Cited by
English version:
Journal of Mathematical Sciences (New York), 2020,
250
:6,
881–894
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024
Fulltext:
PDF file (238 kB)