The number of degree sequences of graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2007
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/38882 |
_version_ | 1826216129090027520 |
---|---|
author | Burns, Jason Matthew |
author2 | Richard P. Stanley. |
author_facet | Richard P. Stanley. Burns, Jason Matthew |
author_sort | Burns, Jason Matthew |
collection | MIT |
description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007. |
first_indexed | 2024-09-23T16:42:47Z |
format | Thesis |
id | mit-1721.1/38882 |
institution | Massachusetts Institute of Technology |
language | eng |
last_indexed | 2024-09-23T16:42:47Z |
publishDate | 2007 |
publisher | Massachusetts Institute of Technology |
record_format | dspace |
spelling | mit-1721.1/388822019-04-10T15:58:26Z The number of degree sequences of graphs Burns, Jason Matthew Richard P. Stanley. Massachusetts Institute of Technology. Dept. of Mathematics. Massachusetts Institute of Technology. Dept. of Mathematics. Mathematics. 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. 2007-09-27T19:30:34Z 2007-09-27T19:30:34Z 2007 2007 Thesis http://hdl.handle.net/1721.1/38882 166267576 eng 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 62 leaves application/pdf Massachusetts Institute of Technology |
spellingShingle | Mathematics. Burns, Jason Matthew The number of degree sequences of graphs |
title | The number of degree sequences of graphs |
title_full | The number of degree sequences of graphs |
title_fullStr | The number of degree sequences of graphs |
title_full_unstemmed | The number of degree sequences of graphs |
title_short | The number of degree sequences of graphs |
title_sort | number of degree sequences of graphs |
topic | Mathematics. |
url | http://hdl.handle.net/1721.1/38882 |
work_keys_str_mv | AT burnsjasonmatthew thenumberofdegreesequencesofgraphs AT burnsjasonmatthew numberofdegreesequencesofgraphs |