Showing 2022 · math.COShow all
2 papers · 2 filters
math.CO2022
On the chromatic numbers of 3-dimensional slices
D. D. Cherkashin, A. J. Kanel-Belov, G. A. Strukov +1
We prove that for an arbitrary holds \[ χ(\mathbb{R}^3 \times [0,\varepsilon]^6) \geq 10, \] where stands for the chromatic number of an (infinite) graph w…
math.CO2022
Erd\H os--Hajnal problem for -free hypergraphs
Danila Cherkashin, Alexei Gordeev, Georgii Strukov
This paper deals with the minimum number of edges in an -free graph with the chromatic number more than . We show how bounds on Ramsey and Turán numbers imply bounds…