The number of unlabelled graphs with many nodes and edges
HTML articles powered by AMS MathViewer
- by E. M. Wright PDF
- Bull. Amer. Math. Soc. 78 (1972), 1032-1034
References
-
1. L. J. Comrie, Chambers’ six-figure math, tables. II, Table XIIA, 1963, pp. 518-519.
- G. W. Ford and G. E. Uhlenbeck, Combinatorial problems in the theory of graphs. IV, Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 163–167. MR 86033, DOI 10.1073/pnas.43.1.163
- E. N. Gilbert, Enumeration of labelled graphs, Canadian J. Math. 8 (1956), 405–411. MR 81470, DOI 10.4153/CJM-1956-046-2
- A. D. Koršunov, The power of certain classes of graphs, Dokl. Akad. Nauk SSSR 193 (1970), 1230–1233 (Russian). MR 0281660
- Walter Oberschelp, Kombinatorische Anzahlbestimmungen in Relationen, Math. Ann. 174 (1967), 53–78 (German). MR 218255, DOI 10.1007/BF01363123 6. M. L. Stein and P. R. Stein, Enumeration of linear graphs and connected linear graphs up to P = 18 points, Los Alamos Scientific Laboratory, 1963.
- E. M. Wright, Asymptotic enumeration of connected graphs, Proc. Roy. Soc. Edinburgh Sect. A 68 (1968/70), 298–308. MR 266820
- E. M. Wright, Graphs on unlabelled nodes with a given number of edges, Acta Math. 126 (1970), 1–9. MR 268076, DOI 10.1007/BF02392023 9. E. M. Wright, Unlabelled graphs with many nodes and edges, Notices Amer. Math. Soc. 19 (1972), A-3. Abstract # 72T-49.
- E. M. Wright, The probability of connectedness of an unlabelled graph can be less for more edges, Proc. Amer. Math. Soc. 35 (1972), 21–25. MR 295954, DOI 10.1090/S0002-9939-1972-0295954-3
Additional Information
- Journal: Bull. Amer. Math. Soc. 78 (1972), 1032-1034
- MSC (1970): Primary 0565
- DOI: https://doi.org/10.1090/S0002-9904-1972-13097-0
- MathSciNet review: 0311508