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)