Upper bounds of Ramsey numbers
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,...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
2014
|
| 在線閱讀: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84867310928&partnerID=40&md5=3640c83f0580634d148f14927d91084d http://cmuir.cmu.ac.th/handle/6653943832/6923 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|