Two extensions of Ramsey's theorem
Ramsey's theorem, in the version of Erdos and Szekeres, states that every 2-coloring of the edges of the complete graph on {1,2,...,n} contains a monochromatic clique of order (1/2)logn. In this article, we consider two well-studied extensions of Ramsey's theorem. Improving a result of Rod...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Duke University Press,
2015-01-14T14:23:53Z.
|
| Subjects: | |
| Online Access: | Get fulltext |