Counting shellings of complete bipartite graphs and trees

Author(s)
Gao, Yibo; Peng, Junyao
Thumbnail
Download10801_2020_965_ReferencePDF.pdf (347.5Kb)
Publisher Policy
Terms of use
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.
Metadata
Show full item record
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.
Date issued
2020-08-09
URI
https://hdl.handle.net/1721.1/136926
Department
Massachusetts Institute of Technology. Department of Mathematics
Publisher
Springer US
Collections