Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/59731Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Decha Samana | en_US |
| dc.contributor.author | Vites Longani | en_US |
| dc.date.accessioned | 2018-09-10T03:20:33Z | - |
| dc.date.available | 2018-09-10T03:20:33Z | - |
| dc.date.issued | 2009-11-01 | en_US |
| dc.identifier.issn | 19929986 | en_US |
| dc.identifier.issn | 19929978 | en_US |
| dc.identifier.other | 2-s2.0-77956985650 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=77956985650&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/59731 | - |
| dc.description.abstract | 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. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Lower bounds of Ramsey numbers R(k,l) | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | IAENG International Journal of Applied Mathematics | en_US |
| article.volume | 39 | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| Appears in Collections: | CMUL: Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.