Lower bounds of Ramsey numbers R(k,l)
For positive integers k and l, the Ramsey number R(k,l) is the least positive integer n such that for every graph G of order n, either G contains K k as a subgraph or Ḡ contains K l as a subgraph. In this paper it is shown that Ramsey numbers R(k,l) ≥...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=77956985650&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/59731 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | For positive integers k and l, the Ramsey number R(k,l) is the least positive integer n such that for every graph G of order n, either G contains K k as a subgraph or Ḡ contains K l as a subgraph. In this paper it is shown that Ramsey numbers R(k,l) ≥ 2kl - 3k - 3l + 6 when 3≤k≤l, and R(k,l) ≥ 2kl - 3k + 2l - 12 when 5≤k≤l. © International Association of Engineers. |
|---|