Exponentially Ramsey Sets
- 作者: Sagdeev A.A.1
-
隶属关系:
- Laboratory of Advanced Combinatorics and Network Applications
- 期: 卷 54, 编号 4 (2018)
- 页面: 372-396
- 栏目: Large Systems
- URL: https://journal-vniispk.ru/0032-9460/article/view/166566
- DOI: https://doi.org/10.1134/S0032946018040051
- ID: 166566
如何引用文章
详细
We study chromatic numbers of spaces \(\mathbb{R}_p^n=(\mathbb{R}^n, \ell_p)\) with forbidden monochromatic sets. For some sets, we for the first time obtain explicit exponentially growing lower bounds for the corresponding chromatic numbers; for some others, we substantially improve previously known bounds.
作者简介
A. Sagdeev
Laboratory of Advanced Combinatorics and Network Applications
编辑信件的主要联系方式.
Email: xp1@protonmail.com
俄罗斯联邦, Moscow
补充文件
