For n = 1, 2, . . . , let 6, = K2+ K,,. We pose the problem of determining the Ramsey numbers r(&, B,) and demonstrate that in many cases critical colorings are available from known examples of strongly regular graphs.
On Ramsey numbers for circuits
β Scribed by H.L Abbott
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 184 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest p such that in every twoβcoloring of the edges of __K~p~__ using colors red (__R__) and blue (__B__), either the blue graph contains an __m__βelement irredundant set or the red graph contains an __n__βelement irredundant set. We
## for my mentors don bonar and gerald thompson We prove the following relation between regressive and classical Ramsey numbers ΒΌ 8; R 4 reg Γ°6Γ ΒΌ 15; and R 5 reg Γ°7Γ536: We prove that R 2 xΓΎk Γ°4Γ42 kΓΎ1 Γ°3 ΓΎ kΓ Γ Γ°k ΓΎ 1Γ; and use this to compute R 2 reg Γ°5Γ ΒΌ 15: Finally, we provide the bounds 19