|
Itogi Nauki i Tekhniki. Sovremennaya Matematika i ee Prilozheniya. Tematicheskie Obzory, 2018, Volume 150, Pages 26–39
(Mi into328)
|
|
|
|
This article is cited in 2 scientific papers (total 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.
Citation:
I. A. Akolzin, “On $3$-Homogeneous Hypergraphs Colorings in $3$ Colors”, Geometry and Mechanics, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 150, VINITI, Moscow, 2018, 26–39; J. Math. Sci. (N. Y.), 250:6 (2020), 881–894
Linking options:
https://www.mathnet.ru/eng/into328 https://www.mathnet.ru/eng/into/v150/p26
|
|