On a Frankl-Wilson Theorem


如何引用文章

全文:

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

详细

We derive an analog of the Frankl-Wilson theorem on independence numbers of some distance graphs. The obtained results are applied to the problem of the chromatic number of a space ℝn with a forbidden equilateral triangle and to the problem of chromatic numbers of distance graphs with large girth.

作者简介

A. Sagdeev

Laboratory of Advanced Combinatorics and Network Applications

编辑信件的主要联系方式.
Email: xp1@protonmail.com
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2019