Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen.

Pólya, G. (1937). Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Mathematica, 145-254.

Type

Journal article

Intellectual base

Primary research

Year

1937

Link

https://doi.org/10.1007/bf02546665matched

Cited from

mathematics

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Symmetry
  • In combinatorics, Burnside's lemma and Pólya's enumeration theorem

    This sourceEnumeration theorem counting configurations up to symmetry. Precedence: Redfield, J. H. "The Theory of Group-Reduced Distributions." American Journal of Mathematics 49 (1927): 433–455 (some modern sources use "Redfield–Pólya"). English combined edition: Pólya and Read, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds (Springer, 1987).

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:525d0135d699 · see in the full table