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: | Conlon, David, Fox, Jacob, Sudakov, Benny |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | en_US |
Published: |
Duke University Press
2015
|
Online Access: | http://hdl.handle.net/1721.1/92847 |
Similar Items
-
TWO EXTENSIONS OF RAMSEY'S THEOREM
by: Conlon, D, et al.
Published: (2013) -
On two problems in graph Ramsey theory
by: Conlon, David, et al.
Published: (2012) -
Ramsey numbers of cubes versus cliques
by: Conlon, David, et al.
Published: (2015) -
Ramsey-type results for semi-algebraic relations
by: Conlon, David, et al.
Published: (2015) -
On two problems in graph Ramsey theory
by: Conlon, D, et al.
Published: (2012)