The probability of connectedness of a large unlabelled graph
HTML articles powered by AMS MathViewer
- by E. M. Wright PDF
- Bull. Amer. Math. Soc. 79 (1973), 767-769
References
- P. Erdős and A. Rényi, On random graphs. I, Publ. Math. Debrecen 6 (1959), 290–297. MR 120167
- E. N. Gilbert, Enumeration of labelled graphs, Canadian J. Math. 8 (1956), 405–411. MR 81470, DOI 10.4153/CJM-1956-046-2 3. M. L. 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
- 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
- E. M. Wright, The number of unlabelled graphs with many nodes and edges, Bull. Amer. Math. Soc. 78 (1972), 1032–1034. MR 311508, DOI 10.1090/S0002-9904-1972-13097-0
Additional Information
- Journal: Bull. Amer. Math. Soc. 79 (1973), 767-769
- MSC (1970): Primary 05C30
- DOI: https://doi.org/10.1090/S0002-9904-1973-13307-5
- MathSciNet review: 0371706