The probabilistic method is a powerful tool for tackling many problems in discrete mathematics. This is one of the strongest tools in combinatorics and in graph theory. It is also useful in number theory and in combinatorial geometry. More recently, it has been applied in the development of efficient algorithms and in the study of various computational problems.
Unable to display preview. Download preview PDF.