Jump to content

Talk:Probabilistic method

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Charvest (talk | contribs) at 19:05, 2 May 2009. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

I removed the reference to the 1959 origins of the method because other examples came earlier, but I'm not sure when the actual origins are. Some sources sited Erdos' 1947 paper, others Szele's hamiltonian cycle result. Quite a few places seem to dodge the issue entirely (perhaps because the line between a "probabilistic" and a "counting" proof is so vague?

What is the connection of this article with this entitled "Probabilistic proofs of non-probabilistic theorems"? Pierre de Lyon (talk) 16:00, 2 May 2009 (UTC)[reply]

I would say this article is about probabilistic proofs in combinatorics, whereas the other article is a list of examples in other areas of mathematics. Charvest (talk) 19:05, 2 May 2009 (UTC)[reply]