MSpace - DSpace at UofM >
Faculty of Graduate Studies (Electronic Theses and Dissertations) >
FGS - Electronic Theses & Dissertations (Public) >

Please use this identifier to cite or link to this item:

Title: The Probabilistic Method and Random Graphs
Authors: Ketelboeter, Brian
Supervisor: Gunderson, David(Mathematics)
Examining Committee: Li, Ben(Computer Science) Doob, Michael(Mathematics)
Graduation Date: February 2013
Keywords: Random graphs
Issue Date: 1-Oct-2012
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.
Appears in Collection(s):FGS - Electronic Theses & Dissertations (Public)

Files in This Item:

File Description SizeFormat
Ketelboeter_Brian.pdf579.19 kBAdobe PDFView/Open
View Statistics

Items in MSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! MSpace Software Copyright © 2002-2010  Duraspace - Feedback