Basic enumeration of graph compositions with a restricted number of components

MaRDI QIDQ4627717zbMATH OpenFDO

Authors Todd Tichenor

Publication date 11 March 2019

Full work available at URL https://arxiv.org/abs/1602.06548

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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.

Recommendations

• Graph compositions. I: Basic enumeration
• The number of designated parts in compositions with restricted parts
• Bounds on graph compositions and the connection to the Bell triangle
• Compositions of graphs revisited
• On composition of numbers and graphs

Cited in

(5)

• Graph compositions. I: Basic enumeration
• On composition of numbers and graphs
• Compositions of graphs revisited
• Graph and union of graphs compositions
• Graph compositions and flats of cycle matroids

This page was built for publication: Basic enumeration of graph compositions with a restricted number of components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4627717)