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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

R. I. Prosanov

Mechanics and Mathematics Faculty

Email: mraigor@yandex.ru
Russian Federation, Moscow, 119991

A. M. Raigorodskii

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

Author for correspondence.
Email: mraigor@yandex.ru
Russian Federation, Moscow, 119991; Dolgoprudnyi, Moscow oblast, 141700; Ulan-Ude, Buryat Republic, 670000

A. A. Sagdeev

Mechanics and Mathematics Faculty

Email: mraigor@yandex.ru
Russian Federation, Moscow, 119991


Copyright (c) 2017 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies