The number of degree sequences of graphs

Author(s)
Burns, Jason Matthew
Thumbnail
DownloadFull printable version (612.5Kb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Mathematics.
Advisor
Richard P. Stanley.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
We give nontrivial upper and lower bounds for the total number of distinct degree sequences among all simple, unlabeled graphs on n vertices (graphical partitions on n vertices). Our upper bound is ... for some constant C, and improvement of ... over the trivial upper bound which is asymptotic to ... Our lower bound is ..., and improvement of ... over the trivial lower bound which is asymptotic to ...
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.
 
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
 
Includes bibliographical references (leaves 60-62).
 
Date issued
2007
URI
http://hdl.handle.net/1721.1/38882
Department
Massachusetts Institute of Technology. Department of Mathematics
Publisher
Massachusetts Institute of Technology
Keywords
Mathematics.
Collections