Show simple item record

dc.contributor.advisorRichard P. Stanley.en_US
dc.contributor.authorBurns, Jason Matthewen_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Mathematics.en_US
dc.date.accessioned2007-09-27T19:30:34Z
dc.date.available2007-09-27T19:30:34Z
dc.date.copyright2007en_US
dc.date.issued2007en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/38882
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.en_US
dc.descriptionThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.en_US
dc.descriptionIncludes bibliographical references (leaves 60-62).en_US
dc.description.abstractWe 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 ...en_US
dc.description.statementofresponsibilityby Jason Matthew Burns.en_US
dc.format.extent62 leavesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectMathematics.en_US
dc.titleThe number of degree sequences of graphsen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.identifier.oclc166267576en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record