A cycle index sum inversion theorem

DOI10.1016/0097-3165(81)90021-2zbMath0466.05037OpenAlexW2011713275MaRDI QIDQ1155067

Philip J. Hanlon

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(81)90021-2

zbMATH Keywords

Möbius function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (3)

The plethystic inverse of a formal power series ⋮ Counting bridgeless graphs ⋮ The theory of compositionals

Cites Work

• Enumeration of non-separable graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]

This page was built for publication: A cycle index sum inversion theorem