Probabilistic method: Difference between revisions

Content deleted Content added
Varkora (talk | contribs)
m Replace "peculiarity" with "weakness" in regards to nonconstructivity. Nonconstructive proofs are common in mathematics, so not particularly peculiar, but are weaker than constructive proofs, as described in the following sentence.
Line 53:
By definition of the [[Ramsey number]], this implies that {{math|''R''(''r'', ''r'')}} must be bigger than {{mvar|n}}. In particular, {{math|''R''(''r'', ''r'')}} must [[exponential growth|grow at least exponentially]] with {{mvar|r}}.
 
A peculiarityweakness of this argument is that it is entirely [[nonconstructive proof|nonconstructive]]. Even though it proves (for example) that almost every coloring of the complete graph on {{math|(1.1)<sup>''r''</sup>}} vertices contains no monochromatic {{mvar|r}}-subgraph, it gives no explicit example of such a coloring. The problem of finding such a coloring has been open for more than 50 years.
 
----