Show simple item record

dc.contributor.supervisorGunderson, David(Mathematics)en_US
dc.contributor.authorKetelboeter, Brian
dc.date.accessioned2012-10-01T21:27:08Z
dc.date.available2012-10-01T21:27:08Z
dc.date.issued2012-10-01
dc.identifier.urihttp://hdl.handle.net/1993/9228
dc.description.abstractThe 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.language.isoengen_US
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectRandom graphsen_US
dc.subjectprobabilityen_US
dc.titleThe Probabilistic Method and Random Graphsen_US
dc.typeinfo:eu-repo/semantics/masterThesis
dc.typemaster thesisen_US
dc.degree.disciplineMathematicsen_US
dc.contributor.examiningcommitteeLi, Ben(Computer Science) Doob, Michael(Mathematics)en_US
dc.degree.levelMaster of Science (M.Sc.)en_US
dc.description.noteFebruary 2013en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record