A cycle index sum inversion theorem

DOI10.1016/0097-3165(81)90021-2MaRDI QIDQ1155067zbMATH OpenOpenAlexFDO

Authors 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

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=M%EF%BF%BD%EF%BF%BDbius+function&go=Go M��bius function]

Mathematics Subject Classification ID

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

Cites work

• Enumeration of non-separable graphs
• On the foundations of combinatorial theory I. Theory of M�bius Functions

Cited in

(3)

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

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

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