BabelNet

bn:03190965n

Noun Named Entity

Categories: Enumerative combinatorics, Articles containing proofs, Graph enumeration, Theorems in combinatorics

Pólya enumeration theorem enumeration theorem Polya's enumeration theorem Polya's formula Polya's theory of enumeration

The Pólya enumeration theorem, also known as the Redfield–Pólya theorem and Pólya counting, is a theorem in combinatorics that both follows from and ultimately generalizes Burnside's lemma on the number of orbits of a group action on a set. Wikipedia

Definitions

Relations

Sources

A mathematical theorem in enumerative combinatorics Wikipedia Disambiguation

Theorem Wikidata

IS A

theorem

Wikipedia

Pólya enumeration theorem

Wikidata

Pólya enumeration theorem

Wikipedia Redirections

enumeration theorem, Polya's enumeration theorem, Polya's formula, Polya's theory of enumeration, Polya enumeration, Polya enumeration formula, Polya enumeration theorem, Polya theorem, Polya theory, Pólya's enumeration theorem, Pólya's formula, Pólya enumeration, Pólya enumeration formula, Pólya theorem, Pólya theory

Wikidata Alias

Polya enumeration theorem