Show simple item record

dc.contributor.supervisor Gunderson, David(Mathematics) en_US
dc.contributor.author Ketelboeter, Brian
dc.date.accessioned 2012-10-01T21:27:08Z
dc.date.available 2012-10-01T21:27:08Z
dc.date.issued 2012-10-01
dc.identifier.uri http://hdl.handle.net/1993/9228
dc.description.abstract 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 thesis presents some of the basic tools used throughout the probabilistic method along with some of the applications of the probabilistic method throughout the fields of Ramsey theory, graph theory and other areas of combinatorial analysis. Then the topic of random graphs is covered. The theory of random graphs was founded during the late fifties and early sixties to study questions involving the effect of probability distributions upon graphical properties. This thesis presents some of the basic results involving graph models and graph properties. en_US
dc.rights info:eu-repo/semantics/openAccess
dc.subject Random graphs en_US
dc.subject probability en_US
dc.title The Probabilistic Method and Random Graphs en_US
dc.type info:eu-repo/semantics/masterThesis
dc.degree.discipline Mathematics en_US
dc.contributor.examiningcommittee Li, Ben(Computer Science) Doob, Michael(Mathematics) en_US
dc.degree.level Master of Science (M.Sc.) en_US
dc.description.note February 2013 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

View Statistics