Improvements of the Frankl–Rödl theorem and geometric consequences


如何引用文章

全文:

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

详细

The Frankl–Rödl classical bound for the number of edges in a hypergraph with forbidden intersections is improved. The improvements are used to obtain new results in Euclidean Ramsey theory and in combinatorial geometry.

作者简介

R. Prosanov

Mechanics and Mathematics Faculty

Email: mraigor@yandex.ru
俄罗斯联邦, Moscow, 119991

A. Raigorodskii

Mechanics and Mathematics Faculty; Moscow Institute of Physics and Technology (State University); Institute of Mathematics and Computer Science

编辑信件的主要联系方式.
Email: mraigor@yandex.ru
俄罗斯联邦, Moscow, 119991; Dolgoprudnyi, Moscow oblast, 141700; Ulan-Ude, Buryat Republic, 670000

A. Sagdeev

Mechanics and Mathematics Faculty

Email: mraigor@yandex.ru
俄罗斯联邦, Moscow, 119991

补充文件

附件文件
动作
1. JATS XML

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