Basic enumeration of graph compositions with a restricted number of components
Combinatorics
2016-02-23 v1
Abstract
The concept of graph compositions is related to several number theoretic concepts, including partitions of positive integers and the cardinality of the power set of finite sets. This paper examines graph compositions where the total number of components is restricted and illustrates a connection between graph compositions and Stirling numbers of the second kind.
Keywords
Cite
@article{arxiv.1602.06548,
title = {Basic enumeration of graph compositions with a restricted number of components},
author = {Todd Tichenor},
journal= {arXiv preprint arXiv:1602.06548},
year = {2016}
}
Comments
10 pages