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 Rodl, we show t...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Duke University Press
2015
|
| Online Access: | http://hdl.handle.net/1721.1/92847 |