Probabilistic method: Difference between revisions

Content deleted Content added
m fixed broken link
m Move footnotes to the right place
Line 54:
 
A weakness 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 problem|open]] for more than 50 years.
 
----
 
{{notelist}}
 
===Second example===
Line 111 ⟶ 107:
* Elishakoff I., Probabilistic Methods in the Theory of Structures: Random Strength of Materials, Random Vibration, and Buckling, World Scientific, Singapore, {{ISBN|978-981-3149-84-7}}, 2017
* Elishakoff I., Lin Y.K. and Zhu L.P., Probabilistic and Convex Modeling of Acoustically Excited Structures, Elsevier Science Publishers, Amsterdam, 1994, VIII + pp.&nbsp;296; {{ISBN|0 444 81624 0}}
{{Reflist}}
 
==Footnotes==
 
{{Reflist}}
{{notelist}}
 
{{Authority control}}