On a distribution problem in finite sets
β Scribed by H.G Meijer
- Publisher
- Elsevier Science
- Year
- 1973
- Weight
- 424 KB
- Volume
- 76
- Category
- Article
- ISSN
- 1385-7258
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let n k denote the number of times the kth largest distance occurs among a set S of n points. We show that if S is the set of vertices of a convex polygone in the euclidean plane, then n1+2n2~3n and n2<~n +n 1. Together with the well-known inequality n~<~n and the trivial inequalities n~>~O and n2>~
In this paper, we consider the following Ramsey theoretic problem for finite ordered sets: For each II 3 1, what is the least integer f(n) so that for every ordered set P of width it, there exists an ordered set Q of width f(n) such that every 2-coloring of the points of Q produces a monochromatic