2026-09-21T03:31:00Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/388822022-01-13T07:54:35Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Richard P. Stanley.
Burns, Jason Matthew
Massachusetts Institute of Technology. Dept. of Mathematics.
Massachusetts Institute of Technology. Department of Mathematics
2007-09-27T19:30:34Z
2007-09-27T19:30:34Z
2007
2007
http://hdl.handle.net/1721.1/38882
166267576
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).
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 ...
by Jason Matthew Burns.
Ph.D.
62 leaves
eng
Massachusetts Institute of Technology
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
Mathematics.
The number of degree sequences of graphs
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="ee6943c3-e852-491b-acdf-5b34a081fd1a">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>The number of degree sequences of graphs</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2007</PublicationDate>
<Authors>
<Author>
<DisplayName>Burns, Jason Matthew</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mathematics.</Keyword>
<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 ...</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>