Order types, trees, and a problem of Erdős and Hajnal
✍ Scribed by Keith J. Devlin
- Publisher
- Springer Netherlands
- Year
- 1974
- Tongue
- English
- Weight
- 451 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0031-5303
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let A=[a 1 , a 2 , ...] N and put A(n)= a i n 1. We say that A is a P-set if no element a i divides the sum of two larger elements. It is proved that for every P-set A with pairwise co-prime elements the inequality A(n)<2n 2Â3 holds for infinitely many n # N. ## 2001 Academic Press where A(n)= a i
This paper shows that under certain conditions a solution of the minimax problem min a<x 1 < } } } <x n <b max 1 i n+1 f i (x 1 , ..., x n ) admits the equioscillation characterizations of Bernstein and Erdo s and has strong uniqueness. This problem includes as a particular example the optimal Lagra