Pólya’s Theory of Counting

  • George Pólya
  • Robert E. Tarjan
  • Donald R. Woods
Part of the Progress in Computer Science book series (PCS, volume 4)


Pólya’s title for this part of the course was actually “Counting Configurations Non-Equivalent with Respect to a Given Permutation Group”. Just about everybody else refers to it as “Pólya’s Theory of Counting”. This latter title is somewhat easier to remember, though not as indicative of the content. We’ll stick to the simpler title; for the content, read on!


Rooted Tree Permutation Group Aliphatic Alcohol Blue Paint Regular Hexagon 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • George Pólya
    • 1
  • Robert E. Tarjan
    • 2
  • Donald R. Woods
    • 3
  1. 1.Department of MathematicsStanford UniversityStanfordUSA
  2. 2.Bell LaboratoriesMurray HillUSA
  3. 3.Xerox CorporationPalo AltoUSA

Personalised recommendations