| dc.contributor.author | Gao, Yibo | |
| dc.contributor.author | Peng, Junyao | |
| dc.date.accessioned | 2021-11-01T14:34:15Z | |
| dc.date.available | 2021-11-01T14:34:15Z | |
| dc.date.issued | 2020-08-09 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/136926 | |
| dc.description.abstract | Abstract
A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite graphs and trees. For complete bipartite graphs, we obtain an exact formula for their shelling numbers. And for trees, we relate their shelling numbers to linear extensions of tree posets and bound shelling numbers using vertex degrees and diameter. | en_US |
| dc.publisher | Springer US | en_US |
| dc.relation.isversionof | https://doi.org/10.1007/s10801-020-00965-0 | en_US |
| dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
| dc.source | Springer US | en_US |
| dc.title | Counting shellings of complete bipartite graphs and trees | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2021-07-24T03:51:38Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | Springer Science+Business Media, LLC, part of Springer Nature | |
| dspace.embargo.terms | Y | |
| dspace.date.submission | 2021-07-24T03:51:38Z | |
| mit.license | PUBLISHER_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | |
