The number of degree sequences of graphs

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 ...

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Mathematics.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2007

Author dc:creator

• Burns, Jason Matthew

Advisor dc:contributor.advisor

• Richard P. Stanley.

• Mathematics.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/38882

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/38882