A cycle index sum inversion theorem

DOI10.1016/0097-3165(81)90021-2zbMATH Open0466.05037OpenAlexW2011713275MaRDI QIDQ1155067FDOQ1155067

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

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

Cited In (3)

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

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)