On a conjecture of Erdös and Rényl
✍ Scribed by Ki Hang Kim; Fred W. Roush
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 526 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We prove the following result: For every two natural numbers n and q, n ~> q + 2, there is a natural number E(n, q) satisfying the following: (1) Let S be any set of points in the plane, no three on a line. If lSl ~> E(n, q), then there exists a convex n-gon whose points belong to S, for which the
We show that every graph G of size at least 256 p 2 |G| contains a topological complete subgraph of order p. This slight improvement of a recent result of Komlós and Szemerédi proves a conjecture made by Mader and by Erdös and Hajnal.
} is a perfect system of difference sets if