The Probabilistic Method and Random Graphs
The probabilistic method in combinatorics is a nonconstructive tool popularized through the work of Paul Erd˝os. Many difficult problems can be solved through a relatively simple application of probability theory that can lead to solutions which are better than known constructive methods. This t...
Main Author: | Ketelboeter, Brian |
---|---|
Other Authors: | Gunderson, David(Mathematics) |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/1993/9228 |
Similar Items
-
The Probabilistic Method and Random Graphs
by: Ketelboeter, Brian
Published: (2012) -
Sparse random graphs methods, structure, and heuristics
by: Fernholz, Daniel Turrin, 1976-
Published: (2008) -
SECRECY TRANSFER FOR SENSOR NETWORKS:FROM RANDOM GRAPHS TO SECURE RANDOM GEOMETRIC GRAPHS
by: Zhihong Liu, et al.
Published: (2013-02-01) -
On straight line representations of random planar graphs
by: Choi, In-kyeong
Published: (2010) -
Relating Vertex and Global Graph Entropy in Randomly Generated Graphs
by: Philip Tee, et al.
Published: (2018-06-01)