Off-diagonal and asymptotic results on the Ramsey number r(K2,m,K2,n)
β Scribed by Roland Lortz; Ingrid Mengersen
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 210 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
An upper bound on the Ramsey number r(K~2,nβs~,K~2,n~) where s β₯ 2 is presented. Considering certain r(K~2,nβs~,K~2,n~)βcolorings obtained from strongly regular graphs, we additionally prove that this bound matches the exact value of r(K~2,nβs~,K~2,n~) in infinitely many cases if $s \approx 2\sqrt n$ holds. Moreover, the asymptotic behavior of r(K~2,m~,K~2,n~) is studied for n being sufficiently large depending on m. We conclude with a table of all known Ramsey numbers r(K~2,m~,K~2,n~) where m,n β€ 10. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 252β268, 2003
π SIMILAR VOLUMES
categorisation is described which has been used to identify the potential ergonomics factors which contribute to the 'near-misses'. Preliminary analyses and practical consideration regarding the usefulness of the approach are also summarised. In conjunction with the 'near-miss' survey, the volunteer