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: | |
---|---|
Other Authors: | |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/1993/9228 |
id |
ndltd-LACETR-oai-collectionscanada.gc.ca-MWU.1993-9228 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-LACETR-oai-collectionscanada.gc.ca-MWU.1993-92282014-03-29T03:44:57Z The Probabilistic Method and Random Graphs Ketelboeter, Brian Gunderson, David(Mathematics) Li, Ben(Computer Science) Doob, Michael(Mathematics) Random graphs probability 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. 2012-10-01T21:27:08Z 2012-10-01T21:27:08Z 2012-10-01 http://hdl.handle.net/1993/9228 |
collection |
NDLTD |
sources |
NDLTD |
topic |
Random graphs probability |
spellingShingle |
Random graphs probability Ketelboeter, Brian The Probabilistic Method and Random Graphs |
description |
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. |
author2 |
Gunderson, David(Mathematics) |
author_facet |
Gunderson, David(Mathematics) Ketelboeter, Brian |
author |
Ketelboeter, Brian |
author_sort |
Ketelboeter, Brian |
title |
The Probabilistic Method and Random Graphs |
title_short |
The Probabilistic Method and Random Graphs |
title_full |
The Probabilistic Method and Random Graphs |
title_fullStr |
The Probabilistic Method and Random Graphs |
title_full_unstemmed |
The Probabilistic Method and Random Graphs |
title_sort |
probabilistic method and random graphs |
publishDate |
2012 |
url |
http://hdl.handle.net/1993/9228 |
work_keys_str_mv |
AT ketelboeterbrian theprobabilisticmethodandrandomgraphs AT ketelboeterbrian probabilisticmethodandrandomgraphs |
_version_ |
1716659008667910144 |