TWO EXTENSIONS OF RAMSEY'S THEOREM
Ramsey's theorem, in the version of Erdo{double acute}s 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) log n. In this article, we consider two well-studied extensions of Ramsey's theorem. Improving a...
主要な著者: | Conlon, D, Fox, J, Sudakov, B |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
2013
|
類似資料
-
Two extensions of Ramsey’s theorem
著者:: Conlon, David, 等
出版事項: (2015) -
On two problems in graph Ramsey theory
著者:: Conlon, D, 等
出版事項: (2012) -
On two problems in graph Ramsey theory
著者:: Conlon, David, 等
出版事項: (2012) -
Ordered Ramsey numbers
著者:: Conlon, D, 等
出版事項: (2016) -
On the grid Ramsey problem and related questions
著者:: Conlon, D, 等
出版事項: (2014)