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.
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).
- In combinatorics, Burnside's lemma and Pólya's enumeration theorem
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:525d0135d699 · see in the full table