Counting Shellings of Complete Bipartite Graphs and Trees
Combinatorics
2021-02-11 v2
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.
Cite
@article{arxiv.1809.10263,
title = {Counting Shellings of Complete Bipartite Graphs and Trees},
author = {Yibo Gao and Junyao Peng},
journal= {arXiv preprint arXiv:1809.10263},
year = {2021}
}
Comments
18 pages