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: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84867310928&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/51784 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
Be the first to leave a comment!