Revision as of 02:52, 20 April 2019 edit Cycle space (talk \| contribs) 116 edits →First example: It is not that kind of edge colouring. ← Previous edit		Revision as of 11:40, 17 October 2019 edit undo Vince Vatter (talk \| contribs) Extended confirmed users 704 edits m →Two examples due to Erdős: The fourth edition of the Alon–Spencer textbook on the subject does not have Erdős' picture on the cover to highlight the method's association with him. Next edit →
Line 14: ==Two examples due to Erdős== Although others before him proved theorems via the probabilistic method (for example, Szele's 1943 result that there exist [[tournament (graph theory)\|tournaments]] containing a large number of [[Hamiltonian cycle]]s), many of the most well known proofs using this method are due to ~~Erdős. Indeed, the Alon-Spencer textbook on the subject has his picture on the cover to highlight the method's association with~~ Erdős. The first example below describes one such result from 1947 that gives a proof of a lower bound for the [[Ramsey's theorem\|Ramsey number]] {{math\|''R''(''r'', ''r'')}}. ===First example===

Probabilistic method: Difference between revisions