On Group Partitions Associated with Lower Bounds for Symmetric Ramsey Numbers
β Scribed by Hill, R.; Irving, R.W.
- Book ID
- 122910083
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 985 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
There is a family (H k ) of graphs such that H k has order (1+o(1))(-2Γe) k 2 kΓ2 but has no clique or stable set of order k. This result of Spencer provides the best known lower bound for the diagonal Ramsey numbers R(k, k). Here we see that the graphs H k can be taken to be regular, self-complemen
Ramsey numbers similar to those of van der Waerden are examined. Rather than considering arithmetic sequences, we look at increasing sequences of positive integers {x1, x2, l l l I x,,} for which there exists a polynomial f(x) = &,aixi, with a, E 2 and Xj+l =f(Xj). We denote by p,(n) the least posit