The number of degree sequences of graphs
Name
166267576-MIT.pdf
Description
Full printable version
Size
612.52 KB
Format
Adobe PDF
Checksum (MD5)
6b6fc5fdf25a359f497f4610436e52d6
Author(s)
Burns, Jason Matthew
Advisor(s)
Richard P. Stanley.
Date Issued
2007
Publisher
Massachusetts Institute of Technology
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).
Subjects
Mathematics.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
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.
Persistent DSpace Link
