RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2013 Volume 49, Issue 4, Pages 98–104 (Mi ppi2127)

This article is cited in 22 papers

Large Systems

New estimates in the problem of the number of edges in a hypergraph with forbidden intersections

E. I. Ponomarenkoa, A. M. Raigorodskiiba

a Faculty of Innovation and Higher Technology, Moscow Institute of Physics and Technology (State University), Moscow, Russia
b Mathematical Statistics and Random Processes Chair, Faculty of Mathematics and Mechanics, Lomonosov Moscow State University, Moscow, Russia

Abstract: We improve the Frankl–Wilson upper bound on the maximal number of edges in a hypergraph with forbidden cardinalities of edge intersections.

UDC: 621.391.1+519.1

Received: 26.06.2013
Revised: 16.10.2013


 English version:
Problems of Information Transmission, 2013, 49:4, 384–390

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026