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