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...
| Hlavní autoři: | , , |
|---|---|
| Médium: | Journal article |
| Jazyk: | English |
| Vydáno: |
2013
|