nLab Pólya enumeration theorem




The Pólya enumeration theorem is a particular theorem in enumerative combinatorics; it serves as a basis of methods often called Pólya’s enumeration (counting) theory. It is especially used in counting of graphs, including often in applications like chemistry.

The Pólya “theory” can be redone in terms of Joyal’s species.


  • wikipedia Pólya enumeration theorem

  • G. Pólya, R. C. Read, Combinatorial enumeration of groups, graphs, and chemical compounds, Springer-Verlag

The theory can also be rederived from state sum identities in certain positive TQFTs:

category: combinatorics

Last revised on May 7, 2023 at 15:15:07. See the history of this page for a list of all contributions to it.