The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
Open accessAbstract
I. Die Entwicklungen dieser Arbeit setzen Untersuehungen yon Cayley fort.Cayley hat wiederholt kombinatorische Aufgaben behandelt, deren Zweck ist, die Anzahl gewisser >>B~ume>> zu bestimmen.1 Einige seiner Aufgaben sind einer chemischea Interpretation f~hig: Die Anzahl der betreffenden >>B~ume>> ist gleich der Anzahl gewisser (theoretisch mSglicher) isomerer ehemischer Verbindungen.Die ausgedehnten numerischen Rechnungen Cayleys wurden yon mehreren Autoren, iusbesondere yon Chemikern nachgepriift und zum Teil berichtigt.Einen eigentlichen Fortschritt brachten meines Erachtens erst die Publikationen yon zwei amerikanischen Chemikern, yon ttenze und Blair, die nicht nur die numerischen Rechnungen Cayley's um ein gutes Stiick welter fiihrten, sondern aueh die Methode verbesserten und weitere Klassen yon Verbindungen in die Berechnung einbezogen.~ Ohne unmittelbaren Zusammenhang mit den Cayleyschen Fragen wurde andererseits erkannt, durch'Lunn and Senior 3, dass gewisse Isomerenzahlen in enger Beziehung zu den Permutationsgruppen stehen.In der vorliegenden Arbeit werde ich die Cayleysche Fragestellung in ver-1 CAYLEY 1--8.Die fettgedruckten Ziffern hinter Namen in Kapitfilschrift verweisen auf die kurze Literaturzusammenstellung S. 253 welche nur die am h~ufigsten zitierten, mit dem Hauptinhalt der Arbeit n~her zusammenh~ngenden Schriften enth~lt.Weitere Literaturangaben finder der Leser im Buche yon D.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Journal of the American Chemical Society
(1946) · Chemical & Engineering News Archive · doi:10.1021/cen-v024n004.p519 · Cited by 300
Cited by
Corless, R. M., Gonnet, G. H., Hare, D. E. G., Jeffrey, D. J., & Knuth, D. E. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02124750 · Cited by 6,150
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
PHYLOGENETIC ANALYSIS: MODELS AND ESTIMATION PROCEDURES
Cavalli-Sforza, L. L., & Edwards, A. W. F. (1967) · Evolution · doi:10.1111/j.1558-5646.1967.tb03411.x · Cited by 2,227
On the foundations of combinatorial theory I. Theory of M�bius Functions
Rota, G. C. (1964) · Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete · doi:10.1007/bf00531932 · Cited by 1,476
Hosoya, H. (1971) · Bulletin of the Chemical Society of Japan · doi:10.1246/bcsj.44.2332 · Cited by 1,268
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
Bollobás, B. (1980) · European Journal of Combinatorics · doi:10.1016/s0195-6698(80)80030-8 · Cited by 1,151
Sinc approximation of algebraically decaying functions
Sytnyk, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.07369 · Cited by 821
Aromaticity of Polycyclic Conjugated Hydrocarbons
Randić, M. (2003) · Chemical Reviews · doi:10.1021/cr9903656 · Cited by 765
(2005) · Choice Reviews Online · doi:10.5860/choice.42-2854b · Cited by 639
Counting unlabeled acyclic digraphs
Robinson, R. W. (1977) · Lecture Notes in Mathematics · doi:10.1007/bfb0069178 · Cited by 368
On the Altitude of Nodes in Random Trees
Meir, A., & Moon, J. W. (1978) · Canadian Journal of Mathematics · doi:10.4153/cjm-1978-085-0 · Cited by 360
The probabilities of rooted tree-shapes generated by random bifurcation
Harding, E. (1971) · Advances in Applied Probability · doi:10.1017/s0001867800037587 · Cited by 317
Self-assembly, modularity, and physical complexity
Ahnert, S. E., Johnston, I. G., Fink, T. M. A., Doye, J. P. K., & Louis, A. A. (2010) · Physical Review E · doi:10.1103/physreve.82.026117 · Cited by 62
Metadata
- Authors
- Pólya, G.
- Venue
- Acta Mathematica
- Publisher
- International Press of Boston
- Published
- 1937
- Volume
- 68
- Issue
- 0
- Pages
- 145-254
- ISSN
- 0001-5962 (ISSN-L)
- OpenAlex
- W2049817705
- Cited by
- 1,009
- References
- 1
- FWCI
- 3.58
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.