Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/51784Full 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-04T06:09:00Z | - |
| dc.date.available | 2018-09-04T06:09:00Z | - |
| dc.date.issued | 2012-10-16 | en_US |
| dc.identifier.issn | 1312885X | en_US |
| dc.identifier.other | 2-s2.0-84867310928 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84867310928&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/51784 | - |
| dc.description.abstract | For positive integers s and t, the Ramsey number R(s, t) is the least positive integer n such that for every graph G of order n, either G contains Ks as a subgraph or G contains Kt as a subgraph. A widely known theorem, proved by Erdös, state that. In this paper, we improve the upper bounds for R(s, t). That is, we find that. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Upper bounds of Ramsey numbers | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Applied Mathematical Sciences | en_US |
| article.volume | 6 | 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.