The smallest Ramsey numbers
✍ Scribed by Rita Csákány; János Komlós
- Book ID
- 108316299
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 362 KB
- Volume
- 199
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The planar Ramsey number \(P R(k, l)(k, l \geqslant 2)\) is the smallest integer \(n\) such that any planar graph on \(n\) vertices contains either a complete graph on \(k\) vertices or an independent set of size \(l\). We find exact values of \(P R(k, l)\) for all \(k\) and \(l\). Included is a pro
It is known that given a Hilbert function H H, there need not exist a module which has uniquely the smallest graded Betti numbers among all modules attaining H H. In this paper we extend the previous example of this behavior to an infinite family and demonstrate with a second infinite family that ev