Upper Bounds for the Chromatic Numbers of Euclidean Spaces with Forbidden Ramsey Sets


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

The chromatic number of a Euclidean space ℝn with a forbidden finite set C of points is the least number of colors required to color the points of this space so that no monochromatic set is congruent to C. New upper bounds for this quantity are found.

作者简介

R. Prosanov

Lomonosov Moscow State University

Email: info@pleiadesonline.com
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2018