The Pólya enumeration theorem is a very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their order.

theorem that is not Burnside's | PET | Redfield-Pólya theorem

status | proved proof date | 1927 (98 years ago) provers | John Howard Redfield | George Pólya

solved mathematics problems | mathematics theorems