The complete intersection theorem for systems of finite sets
European Journal of Combinatorics
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
Motivated by a coding problem for Gaussian channels, Burnashev came to the following Geometric Problem (which he stated at the Information Theory Meeting in Oberwolfach, Germany, April 1982). For every δ 0, does there exist a constant λ(δ) 0 such that the following is true: “Every finite set {x1,...,xN} in a Hilbert space H has a subset $\{x_{i_1},\dots,x_{i_M}\}$, M≥λ(δ)N, without ‘bad' triangles. (A triangle is bad, if one side is longer than 1+δ and the two others are shorter (≤) than 1)”?