{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:53:56Z","timestamp":1761292436897,"version":"3.33.0"},"reference-count":244,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8707,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1982,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a review of results dealing with structural properties and numerical characteristics of random edge\u2010subgraphs of complete graphs, with the connectedness of random graphs, as well as with random trees and forests.<\/jats:p>","DOI":"10.1002\/jgt.3190060402","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:01:20Z","timestamp":1180422080000},"page":"349-389","source":"Crossref","is-referenced-by-count":74,"title":["A review of random graphs"],"prefix":"10.1002","volume":"6","author":[{"given":"Micha\u0142","family":"Karo\u0144ski","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"30","volume-title":"Conf. Rec. Nineth Annual ACM Symp. Theory Comput., Boulder, CO, 1977","author":"Angluin N. D.","year":"1977"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706204"},{"key":"e_1_2_1_4_2","unstructured":"G. N.Bagaev Distribution of the number of vertices in strata of a random connected graph with one cycle. InII Vsesoy. Konf. po Probl. Teoret. Kiber. Novosybirsk (1971)50[in Russian]."},{"key":"e_1_2_1_5_2","first-page":"3","article-title":"A certain distribution in a random tree, I","volume":"21","author":"Bagaev G. N.","year":"1972","journal-title":"Diskret. Analiz"},{"key":"e_1_2_1_6_2","first-page":"3","article-title":"A certain distribution in a random tree, II","volume":"24","author":"Bagaev G. N.","year":"1974","journal-title":"Diskret. Analiz"},{"key":"e_1_2_1_7_2","first-page":"3","article-title":"Random graphs with degree of connectedness 2","volume":"22","author":"Bagaev G. N.","year":"1973","journal-title":"Diskret. Analiz"},{"key":"e_1_2_1_8_2","unstructured":"G. N.Bagaev Distribution of the number of vertices in a component of connected graph with randomly eliminated edges. InIII Vsesoy. Konf. po Probl. Teor. Kiber. Novosybirsk (1974)137[in Russian]."},{"key":"e_1_2_1_9_2","first-page":"55","article-title":"Limit distributions of metric characteristics of a random indecomposable mapping","volume":"2","author":"Bagaev G. N.","year":"1977","journal-title":"Kombin. Asimp. Analiz"},{"key":"e_1_2_1_10_2","first-page":"1061","article-title":"The distribution of the number of vertices in a component of an indecomposable random mapping","volume":"21","author":"Bagaev G. N.","year":"1977","journal-title":"Dokl. Akad. Nauk BSSR"},{"key":"e_1_2_1_11_2","first-page":"89","article-title":"A regular threshold function for a discontinuity of a chain in a random tree","volume":"9","author":"Bagaev G. N.","year":"1971","journal-title":"Control Syst."},{"volume-title":"Statistical Theory of Reliability and Life Testing","year":"1975","author":"Barlow R. E.","key":"e_1_2_1_12_2"},{"key":"e_1_2_1_13_2","unstructured":"A. R.Bloemena Sampling from a Graph. Math. Centre Tracts Amsterdam (1964). (MR 30#5450.)"},{"key":"e_1_2_1_14_2","first-page":"1","article-title":"Degree sequences of a random graphs","volume":"9","author":"Bollob\u00e1s B.","year":"1978","journal-title":"Prep. Ser. Mat. Inst. Aarhus Univ."},{"volume-title":"Graph Theory\u2014An Introductory Course","year":"1979","author":"Bollob\u00e1s B.","key":"e_1_2_1_15_2"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100053056"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50007-6"},{"key":"e_1_2_1_18_2","first-page":"497","article-title":"Asymptotic estimates of the diameter, independence and dominance numbers of a random graph","volume":"14","author":"Burtin Yu. D.","year":"1973","journal-title":"Soviet Math. Dokl."},{"key":"e_1_2_1_19_2","first-page":"118","article-title":"Asymptotic estimates of the degrees of connectivity of a random graph","volume":"3","author":"Burtin Yu. D.","year":"1973","journal-title":"Kibernetika"},{"issue":"4","key":"e_1_2_1_20_2","first-page":"711","article-title":"On extreme metric characteristics of a random graph I. Asymptotic estimates","author":"Burtin Yu. D.","year":"1974","journal-title":"Theor. Probability Appl."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1137\/1120007"},{"issue":"2","key":"e_1_2_1_22_2","first-page":"90","article-title":"On probability of connectivity of random subgraph of n\u2010dimensional cube","volume":"13","author":"Burtin Yu. D.","year":"1977","journal-title":"Problems of Information Transmission"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.2164-0947.1970.tb02070.x"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0067358"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1974.tb20563.x"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206046"},{"key":"e_1_2_1_27_2","unstructured":"M.DondajewskiandJ.Szyma\u0144ski On the distribution of vertex degrees in a strata of a random recursive tree. To appear."},{"key":"e_1_2_1_28_2","first-page":"124","volume-title":"Systems for the Distribution of Information","author":"Epihin V. V.","year":"1972"},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1959-003-9"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1961-029-9"},{"key":"e_1_2_1_31_2","first-page":"133","volume-title":"Theory of Graphs and Applications. Proc. of the Symp. held in Smolenice in June 1963","author":"Erd\u00f6s P.","year":"1964"},{"key":"e_1_2_1_32_2","unstructured":"P.Erd\u00f6s Some new applications of probability methods to combinatorial analysis and graph theory. InProc. of the Fifth Southeastern Conf. on Combinatorics Graph Theory and Computing Boca Raton (1974)39\u201351. (MR 51 #275.)"},{"key":"e_1_2_1_33_2","first-page":"183","volume-title":"Recent Adv. in Graph Theory, Proc. Symp. Prague 1974","author":"Erd\u00f6s P.","year":"1975"},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_2_1_35_2","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u00f6s P.","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"e_1_2_1_36_2","first-page":"343","article-title":"On the evolution of random graphs","volume":"38","author":"Erd\u00f6s P.","year":"1961","journal-title":"Bull. Inst. Internal Statist. Tokyo"},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02066689"},{"key":"e_1_2_1_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01895716"},{"key":"e_1_2_1_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01894879"},{"key":"e_1_2_1_40_2","first-page":"455","article-title":"On random matrices I","volume":"8","author":"Erd\u00f6s P.","year":"1964","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"e_1_2_1_41_2","first-page":"459","article-title":"On random matrices II","volume":"3","author":"Erd\u00f6s P.","year":"1968","journal-title":"Studia Sci. Math. Hung."},{"volume-title":"Probabilistic Methods in Combinatorics","year":"1974","author":"Erd\u00f6so P.","key":"e_1_2_1_42_2"},{"key":"e_1_2_1_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(81)90137-1"},{"key":"e_1_2_1_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(77)90039-9"},{"key":"e_1_2_1_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(71)90009-4"},{"volume-title":"Communication, Transmition and Transportation Networks","year":"1971","author":"Frank H.","key":"e_1_2_1_46_2"},{"key":"e_1_2_1_47_2","unstructured":"O.Frank Statistical Inference in Graphs. FOA Repro Stockholm (1971)."},{"key":"e_1_2_1_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(77)90011-8"},{"key":"e_1_2_1_49_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1979.tb32791.x"},{"key":"e_1_2_1_50_2","doi-asserted-by":"publisher","DOI":"10.1080\/00949657908810285"},{"volume-title":"Sociological Methodology 1981","year":"1980","author":"Frank O.","key":"e_1_2_1_51_2"},{"journal-title":"J. Math. Sociology.","article-title":"Transistivity in stochastic graphs and digraphs","author":"Frank O.","key":"e_1_2_1_52_2"},{"key":"e_1_2_1_53_2","article-title":"On random planar graphs","volume":"4","author":"Frank O.","year":"1980","journal-title":"Dept. Stat., Univ. Lund, Tech. Rep. No."},{"key":"e_1_2_1_54_2","article-title":"On reliability in stochastic graphs","volume":"318","author":"Frank O.","year":"1979","journal-title":"Applied Math. Dept. Univ. of Bonn, Prep. No."},{"key":"e_1_2_1_55_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(79)90004-2"},{"key":"e_1_2_1_56_2","first-page":"469","article-title":"A note on reliability of communication networks","volume":"10","author":"Fu Y.","year":"1962","journal-title":"J. SIAM"},{"key":"e_1_2_1_57_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"e_1_2_1_58_2","first-page":"15","article-title":"A statistically effective algorithm of finding a Hamiltonian circuit cycle","volume":"22","author":"Gimadi E. H.","year":"1973","journal-title":"Diskret. Analiz"},{"key":"e_1_2_1_59_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010408"},{"key":"e_1_2_1_60_2","doi-asserted-by":"crossref","unstructured":"G. R.Grommett Random graph theorems. In Trans Seventh Prague Conf. Inf. Theory Stat. Decision Funct. Random Process. and 1974 European Meet. Stat. Prague Vol. A. Prague (1977)203\u2013209.","DOI":"10.1007\/978-94-010-9910-3_21"},{"volume-title":"Further Selected Topics in Graph Theory","year":"1980","author":"Grimmett G. R.","key":"e_1_2_1_61_2"},{"key":"e_1_2_1_62_2","unstructured":"G. R.Grimmett Random Labelled trees and their branching networks. To appear."},{"key":"e_1_2_1_63_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100051124"},{"key":"e_1_2_1_64_2","unstructured":"A.Grusho On the distribution of the height of a fixed vertex in a random rooted tree.Kombinator. i Asimpt. Analiz.Krasnoyarsk (1975)123\u2013135[in Russian]."},{"issue":"4","key":"e_1_2_1_65_2","first-page":"894","article-title":"Percolation processes and related topics","volume":"11","author":"Hammersley J. M.","year":"1963","journal-title":"J. SIAM"},{"volume-title":"Graphical Enumeration","year":"1973","author":"Harary F.","key":"e_1_2_1_66_2"},{"key":"e_1_2_1_67_2","first-page":"91979","article-title":"The probability that a point of a tree is fixed","volume":"85","author":"Harary F.","journal-title":"Math. Proc. Camb. Philos. Soc."},{"journal-title":"Ann. New York Acad. Sci.","article-title":"Obits in random trees","author":"Harary F.","key":"e_1_2_1_68_2"},{"key":"e_1_2_1_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02163181"},{"issue":"2","key":"e_1_2_1_70_2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1111\/j.2517-6161.1969.tb00791.x","article-title":"Majorants of the chromatic number of a random graph","volume":"31","author":"Holgate P.","year":"1969","journal-title":"J. Royal Statist. Soc."},{"key":"e_1_2_1_71_2","doi-asserted-by":"publisher","DOI":"10.1137\/1118020"},{"issue":"2","key":"e_1_2_1_72_2","first-page":"396","article-title":"The strength of connectedness of a random graph","author":"Ivcenko G. I.","year":"1973","journal-title":"Theory Prob. Appl."},{"key":"e_1_2_1_73_2","first-page":"34","article-title":"Unequally probable random graphs","volume":"44","author":"Ivcenko G. I.","year":"1975","journal-title":"Trudy Mosk, Inst. Elektr. Masz."},{"key":"e_1_2_1_74_2","unstructured":"G. I.IvcenkoandI. V.Medvedev Probability of connectedness of some class of random graphs.Vopr. Kibernetiki Moskva 1973 60\u201366[in Russian]."},{"key":"e_1_2_1_75_2","unstructured":"J. G.Kalbfleisch Complete subgraphs of random hypergraphs and bipartite graphs. InProc. Third Southeastern Conf. on Combinatoics Graph Theory and Comp. Boca Raton (1972)297\u2013304. (MR 50 #6925.)"},{"key":"e_1_2_1_76_2","first-page":"111","article-title":"Statistical estimate for the chromatic number of the graphs of some class","volume":"7","author":"Kalnin'sh A. A.","year":"1970","journal-title":"Latvijskij Mat. Jez."},{"key":"e_1_2_1_77_2","unstructured":"M.Karo\u0144ski Maximal induced trees in a random bichromatic graph. To appear."},{"journal-title":"Probability and Math. Statist.","article-title":"On the number of k\u2010trees in a random graph","author":"Karo\u0144ski M.","key":"e_1_2_1_78_2"},{"key":"e_1_2_1_79_2","first-page":"151","article-title":"On the size of a maximal induced tree in a random graph","volume":"30","author":"Karo\u0144ski M.","year":"1980","journal-title":"Math. Slovaca"},{"key":"e_1_2_1_80_2","unstructured":"M.Karo\u0144skiandA.Ruci\u0144ski On the number of strictly balanced subgraphs of a random graph. To appear."},{"key":"e_1_2_1_81_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728496"},{"issue":"3","key":"e_1_2_1_82_2","article-title":"Some problems of the analysis of reliability of nets","volume":"26","author":"Kel'mans A. K.","year":"1965","journal-title":"Automat. Remote Control"},{"volume-title":"S. Kiber na Sl. Kommunizma, 4","year":"1967","author":"Kel'mans A. K.","key":"e_1_2_1_83_2"},{"key":"e_1_2_1_84_2","unstructured":"A. K.Kel'mans Problems of analysis and synthesis of random graphs InFifteenth International Wiss. Kolloquium Tech. Hochschule Ilmenau (1970) [in Russian]."},{"key":"e_1_2_1_85_2","unstructured":"A. K.Kel'mans Probabilistic networks with randomly eleiminated nodes. InDokl. Vses. Sovese. po Statist. Metodam Teorii Upravlenija.Moskva (1970)15\u201327[in Russian]."},{"issue":"11","key":"e_1_2_1_86_2","first-page":"1833","article-title":"On estimation of probabilistic characteristics of random graphs","volume":"32","author":"Kel'mans A. K.","year":"1970","journal-title":"Automat. Remote Control"},{"key":"e_1_2_1_87_2","first-page":"264","volume-title":"Adaptive Systems. Large Systems","author":"Kel'mans A. K.","year":"1971"},{"issue":"4","key":"e_1_2_1_88_2","article-title":"The connectivity of graphs with randomly eliminated vertices","volume":"33","author":"Kel'mans A. K.","year":"1972","journal-title":"Automat. Remote Control"},{"issue":"2","key":"e_1_2_1_89_2","first-page":"243","article-title":"Asymptic formulae for the probability of k\u2010connectedness of random graphs","author":"Kel'mans A. K.","year":"1972","journal-title":"Theory Prob. Appl."},{"key":"e_1_2_1_90_2","unstructured":"A. K.Kel'mans Studies on random graphs. InTrudy IV Vsesoy. Sov. po Avtomat. Uprav.Nauka Moskva (1972) [in Russian]."},{"key":"e_1_2_1_91_2","first-page":"406","volume-title":"Issled. po Discret. Optim","author":"Kel'mans A. K.","year":"1976"},{"key":"e_1_2_1_92_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90102-3"},{"key":"e_1_2_1_93_2","unstructured":"A. K.Kel'mans Comparison of graphs by their probability of connectedness. InKombinator. i Asimpt. Analiz Kasnoyrsk (1977)69\u201381[in Russian]."},{"issue":"1","key":"e_1_2_1_94_2","first-page":"2","article-title":"The graph with the maximum probability of remaining connected depends upon the edge\u2010removal probability","volume":"9","author":"Kel'mans A. K.","year":"1979","journal-title":"Graph Theory Newsletter"},{"key":"e_1_2_1_95_2","article-title":"Graphs with an extremal number of spanning trees","volume":"4","author":"Kel'mans A. K.","year":"1980","journal-title":"J. Graph Theory"},{"journal-title":"Graph Theory Newsletter.","article-title":"Operations on graphs increasing the probability of their connectedness","author":"Kel'mans A. K.","key":"e_1_2_1_96_2"},{"journal-title":"Acta Math. Sci. Hung.","article-title":"On graphs with randomly deleted edges","author":"Kel'mans A. K.","key":"e_1_2_1_97_2"},{"key":"e_1_2_1_98_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90065-3"},{"journal-title":"J. Combinatorial. Theory Ser. B","first-page":"375","year":"1978","key":"e_1_2_1_98_3"},{"issue":"3","key":"e_1_2_1_99_2","first-page":"1","article-title":"Non\u2010isomorphic trees with the same probability of connectivity","volume":"8","author":"Kel'mans A. K.","year":"1979","journal-title":"Graph Theory Newsletter"},{"key":"e_1_2_1_100_2","unstructured":"A. K.Kel'mansandM. A.Zaitsev Non\u2010isomorphic trees with the same probability of connectivity.Sist. Issl. Metall. Processov i. Proizvod. MISiS Nauch. TrudyNo. 122 (1980)87\u201390[in Russian]."},{"key":"e_1_2_1_101_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0070388"},{"key":"e_1_2_1_102_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788236"},{"key":"e_1_2_1_103_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01140027"},{"key":"e_1_2_1_104_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01097183"},{"volume-title":"Random Allocations","year":"1976","author":"Kolchin V. F.","key":"e_1_2_1_105_2"},{"key":"e_1_2_1_106_2","first-page":"1003","volume-title":"Infinite and Finite Sets. Vol. II, Coll. Math. Soc. J\u00e1nos Bolyai","author":"Koml\u00f3s J.","year":"1975"},{"key":"e_1_2_1_107_2","unstructured":"J.Koml\u00f3sandE.Szermer\u00e9di Limit distribution for the existence of Hamilton cycles in a random graph. To appear."},{"key":"e_1_2_1_108_2","first-page":"55","article-title":"Probability of the connectedness of random graphs","volume":"9","author":"Kordecki W.","year":"1973","journal-title":"Prace Naukowe Inst. mat. Fiz. Teor. Pol. Wroclaw"},{"key":"e_1_2_1_109_2","article-title":"The connectedness of random s\u2010graphs","volume":"164","author":"Kordecki W.","year":"1974","journal-title":"Inst. Math. Wroclaw Tech. Univ. Technical Report"},{"key":"e_1_2_1_110_2","article-title":"Elements of the theory of random graphs","volume":"15","author":"Kordecki W.","year":"1976","journal-title":"Sci. Papers of the Inst. of Math. Wroclaw Tech. Univ."},{"key":"e_1_2_1_111_2","first-page":"1100","article-title":"On the power of some classes of graphs","volume":"11","author":"Kor\u0161unov A. D.","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"e_1_2_1_112_2","first-page":"1013","article-title":"On diameter of graphs","volume":"12","author":"Kor\u0161unov A. D.","year":"1971","journal-title":"Soviet Math. Dokl."},{"issue":"3","key":"e_1_2_1_113_2","first-page":"760","article-title":"Solution of a problem of Erd\u00f6s and R\u00e9nyi on Hamiltonian cycles in undirected graphs","volume":"17","author":"Kor\u0161unov A. D.","year":"1976","journal-title":"Soviet Math. Dokl."},{"key":"e_1_2_1_114_2","first-page":"17","article-title":"Solution of a problem of Erd\u00f6s and R\u00e9nyi on Hamiltonian cycles in undirected graphs","volume":"31","author":"Kor\u0161unov A. D.","year":"1977","journal-title":"Diskret. Analiz"},{"key":"e_1_2_1_115_2","first-page":"1","article-title":"On the theory of random graphs","volume":"4","author":"Kovalenko I. N.","year":"1971","journal-title":"Kibernetika"},{"key":"e_1_2_1_116_2","first-page":"83","article-title":"Structure of random directed graph","volume":"6","author":"Kovalenko I. N.","year":"1975","journal-title":"Theory of Probable and Math. Statist."},{"key":"e_1_2_1_117_2","first-page":"27","article-title":"The size of cut set in a random graph","volume":"29","author":"Kozyrev V. P.","year":"1974","journal-title":"Problemy Kibernetiki"},{"key":"e_1_2_1_117_3","first-page":"342","article-title":"The size of cut set in a random graph","volume":"30","year":"1975","journal-title":"Problemy Kibernetiki"},{"key":"e_1_2_1_118_2","first-page":"447","volume-title":"Fundamentals of Computation Theory. Lecture Notes in Computer Science No. 56","author":"Ku\u010dera L.","year":"1977"},{"key":"e_1_2_1_119_2","first-page":"138","volume-title":"Informacionnye Seti i Kommutacia","author":"Krakovskaia O. S.","year":"1968"},{"key":"e_1_2_1_120_2","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996856"},{"key":"e_1_2_1_121_2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1080\/01621459.1973.10481356","article-title":"A probability theory of cluster analysis","volume":"68","author":"Ling R.","year":"1973","journal-title":"J. Amer. Statist. Assoc."},{"key":"e_1_2_1_122_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2496(75)90051-6"},{"key":"e_1_2_1_123_2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1080\/01621459.1976.10480335","article-title":"Probability tables for cluster analysis based on a theory of random graphs","volume":"71","author":"Ling R.","year":"1976","journal-title":"J. Amer. Statist. Assoc."},{"key":"e_1_2_1_124_2","unstructured":"E. I.Litvak Estimates of some probabilistic characteristics of bipolar graphs. In Graphs Hypergraphs and Discrete Optim. Probl. Kiev (1977)12\u201314[in Russian]."},{"issue":"1","key":"e_1_2_1_125_2","first-page":"73","article-title":"Bernoulli scheme with closure","volume":"10","author":"Lomonosov M. V.","year":"1974","journal-title":"Problems of Information Transmission"},{"issue":"4","key":"e_1_2_1_126_2","first-page":"337","article-title":"Reliability upper bound for information networks","volume":"7","author":"Lomonosov M. V.","year":"1971","journal-title":"Problems of Information Transmission"},{"issue":"2","key":"e_1_2_1_127_2","article-title":"Lower bound on network reliability","volume":"8","author":"Lomonosov M. V.","year":"1972","journal-title":"Problems of Information Transmission"},{"issue":"4","key":"e_1_2_1_128_2","article-title":"The maximum of the probability of connectivity","volume":"8","author":"Lomonosov M. V.","year":"1972","journal-title":"Problems of Information Transmission"},{"key":"e_1_2_1_129_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01095132"},{"key":"e_1_2_1_130_2","first-page":"68","article-title":"Hypertrees with a given number of endpoints and edges","volume":"3","author":"Lyamin V. N.","year":"1974","journal-title":"Kombinatornyi Analiz"},{"key":"e_1_2_1_131_2","first-page":"57","article-title":"Enumeration problems for simple hypergraphs","volume":"3","author":"Lyamin V. N.","year":"1974","journal-title":"Kombinatornyi Analiz"},{"key":"e_1_2_1_132_2","first-page":"88","article-title":"Enumeration problems for simple hypergraphs. II","volume":"4","author":"Lyamin V. N.","year":"1976","journal-title":"Kombinatoryni Analiz"},{"issue":"2","key":"e_1_2_1_133_2","article-title":"Probabilistic properties of graphs with large connectivity","volume":"10","author":"Margulis G. A.","year":"1974","journal-title":"Problems of Information Transmission"},{"volume-title":"Applied Graph Theory","year":"1971","author":"Marshall C. W.","key":"e_1_2_1_134_2"},{"key":"e_1_2_1_135_2","first-page":"356","volume-title":"Proc. of the second Chapell Hill Conf. on Comb. Math. and Appl","author":"Matula D. W.","year":"1970"},{"key":"e_1_2_1_136_2","first-page":"A\u2010382","article-title":"The employee party problems","volume":"19","author":"Matula D. W.","year":"1972","journal-title":"Notices Amer. Math Soc."},{"key":"e_1_2_1_137_2","unstructured":"D. W.Matula The largest clique size in a random graph.Technical Rep. Dept. of Comp. Sci. Southern Methodist Univ. Dallas(1976)."},{"key":"e_1_2_1_138_2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/B978-1-4832-3187-7.50015-5","volume-title":"Graph Theory and Computing","author":"Matula D. W.","year":"1972"},{"journal-title":"Proc. Essex Conf. on Combinatorics and Optimization.","article-title":"Clutter percolation and random graphs","author":"McDiarmid C. J. H.","key":"e_1_2_1_139_2"},{"key":"e_1_2_1_140_2","unstructured":"C. J. H.McDiarmid Dependent random variables random graphs and percolation. To appear."},{"key":"e_1_2_1_141_2","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300002552"},{"key":"e_1_2_1_142_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700006698"},{"key":"e_1_2_1_143_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80012-6"},{"key":"e_1_2_1_144_2","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(73)90029-2"},{"key":"e_1_2_1_145_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01838195"},{"key":"e_1_2_1_146_2","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(74)90013-3"},{"key":"e_1_2_1_147_2","first-page":"351","volume-title":"Recent Advances in Graph Theory. Proc. Second Chechoslovak Symp. Prague 1974","author":"Meir A.","year":"1975"},{"key":"e_1_2_1_148_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1975.61.225"},{"key":"e_1_2_1_149_2","unstructured":"A.MeirandJ. W.Moon Climbing certain type of rooted trees.Proc. of the Fifth British Combinatorial Conference(1975)461\u2013469. (MR 53 #5348.)"},{"key":"e_1_2_1_150_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01896073"},{"key":"e_1_2_1_151_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010211"},{"key":"e_1_2_1_152_2","doi-asserted-by":"publisher","DOI":"10.2307\/1997828"},{"key":"e_1_2_1_153_2","first-page":"403","volume-title":"Theory and Applications of Graphs Proc. Int. Conf., Western Michigan Univ. Kalamazoo, 1976. Lecture Notes in Math","author":"Meir A.","year":"1978"},{"key":"e_1_2_1_154_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100055328"},{"key":"e_1_2_1_155_2","first-page":"313","article-title":"Path edge\u2010covering constants for certain families of trees","volume":"14","author":"Meir A.","year":"1978","journal-title":"Util. Math."},{"key":"e_1_2_1_156_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1978-085-0"},{"key":"e_1_2_1_157_2","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1029000098"},{"volume-title":"Topics on Tournaments","year":"1968","author":"Moon J. W.","key":"e_1_2_1_158_2"},{"key":"e_1_2_1_159_2","unstructured":"J. W.Moon Counting labelled Trees.Canadian Math. Congress Montreal(1970). (MR 43 #98.)"},{"key":"e_1_2_1_160_2","first-page":"83","article-title":"The spread of blight in a random tree","volume":"13","author":"Moon J. W.","year":"1970","journal-title":"Jahrverslag Die Suid\u2010Afrikaanse Wiskundevereinigung"},{"key":"e_1_2_1_161_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01819273"},{"key":"e_1_2_1_162_2","unstructured":"J. W.Moon The expected number of inversions in a random tree. InProc. Lousiana Conf. on Comb. Graph Theory and Comput.(1970)375\u2013382. (MR 42 #5849.)"},{"key":"e_1_2_1_163_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(71)90043-8"},{"key":"e_1_2_1_164_2","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300008391"},{"key":"e_1_2_1_165_2","first-page":"197","volume-title":"Lecture Notes in Mathematics","author":"Moon J. W.","year":"1972"},{"key":"e_1_2_1_166_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1972-008-3"},{"key":"e_1_2_1_167_2","first-page":"281","article-title":"The variance of the number of spanning cycles in a random graph","volume":"7","author":"Moon J. W.","year":"1972","journal-title":"Studia Sci. Math. Hungar."},{"key":"e_1_2_1_168_2","doi-asserted-by":"publisher","DOI":"10.1017\/S144678870001274X"},{"key":"e_1_2_1_169_2","doi-asserted-by":"crossref","unstructured":"J. W.Moon The distance between nodes in recursive trees. InProceedings of the British Combinatorial Conference 1973 Cambridge U. P. (1974)125\u2013132. (MR 50 #9654.)","DOI":"10.1017\/CBO9780511662072.019"},{"key":"e_1_2_1_170_2","doi-asserted-by":"publisher","DOI":"10.1016\/0016-0032(56)90559-2"},{"key":"e_1_2_1_171_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699075"},{"key":"e_1_2_1_172_2","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(70)90071-4"},{"key":"e_1_2_1_173_2","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996455"},{"key":"e_1_2_1_174_2","first-page":"1527","volume-title":"Information Processing","author":"Ogilvie J. C.","year":"1969"},{"key":"e_1_2_1_175_2","doi-asserted-by":"publisher","DOI":"10.2307\/2036523"},{"key":"e_1_2_1_176_2","first-page":"405","article-title":"On the distribution of the number of trees which are isolated subraphs of a chromatic random graph","volume":"6","author":"Pal\u00e1sti I.","year":"1961","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"e_1_2_1_177_2","first-page":"215","article-title":"Thershold function for subgraphs of given type of the bichromatic random graph","volume":"7","author":"Pal\u00e1sti I.","year":"1962","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"e_1_2_1_178_2","first-page":"431","article-title":"On the connectedness of bichromatic random graphs","volume":"8","author":"Pal\u00e1sti I.","year":"1963","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"e_1_2_1_179_2","first-page":"205","article-title":"On the strong connectedness of directed random graphs","volume":"1","author":"Pal\u00e1sti I.","year":"1966","journal-title":"Stud. Sci. Math. Hungar."},{"key":"e_1_2_1_180_2","unstructured":"I.Pal\u00e1sti On the connectedness of random graphs.Studies in Math. Stat. Theory and Appl.Akad. Kiado Budapest (1968)105\u2013108. (MR 37 #3948)."},{"key":"e_1_2_1_181_2","first-page":"33","article-title":"On some structural properties of given types of random graphs","volume":"19","author":"Pal\u00e1sti I.","year":"1970","journal-title":"Magyar Tud. Akad. Mat. Fix. Oszt. K\u00f6zl."},{"key":"e_1_2_1_182_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02029168"},{"key":"e_1_2_1_183_2","first-page":"67","article-title":"On the treshold distribution function of cycles in a directed random graphs","volume":"6","author":"Pal\u00e1sti I.","year":"1971","journal-title":"Studia Sci. Math. Hungar."},{"issue":"2","key":"e_1_2_1_184_2","article-title":"Isolated trees in a random graph","volume":"17","author":"Palka Z.","year":"1981","journal-title":"Applicationes Math."},{"journal-title":"Colloq. math.","article-title":"Isolated trees in a bichromatic random graph","author":"Palka Z.","key":"e_1_2_1_185_2"},{"journal-title":"Colloq. Math.","article-title":"On pendant vertices in random graphs","author":"Palka Z.","key":"e_1_2_1_186_2"},{"key":"e_1_2_1_187_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(79)90073-X"},{"issue":"3","key":"e_1_2_1_188_2","article-title":"The asymptotic distribution of maximum tree size in a random forest","author":"Pavlov Yu L.","year":"1977","journal-title":"Theory Prob. Appl."},{"key":"e_1_2_1_189_2","doi-asserted-by":"publisher","DOI":"10.1070\/SM1977v032n03ABEH002390"},{"key":"e_1_2_1_190_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01224845"},{"key":"e_1_2_1_191_2","first-page":"1376","article-title":"On two problems form graph theory","volume":"11","author":"Perepelica V. A.","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"e_1_2_1_192_2","unstructured":"G. S.Plesnevich On internal stable sets of a random graph. InEighth All\u2010Union Coll. on General Algebra Riga (1967) [in Russian]."},{"key":"e_1_2_1_193_2","first-page":"9","article-title":"On the average number of exact covers","volume":"2","author":"Plesnevich G. S.","year":"1979","journal-title":"Izv. AN Turkm. SSR, Ser. Fiz.\u2010Tech., Chim. i Geol. Nauk"},{"key":"e_1_2_1_194_2","first-page":"172","article-title":"A certain lower bound for the reliability of information networks","volume":"7","author":"Polessky V. P.","year":"1971","journal-title":"Problems of Information Transmission"},{"key":"e_1_2_1_195_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90068-6"},{"key":"e_1_2_1_196_2","first-page":"73","article-title":"Some remarks on the theory of trees","volume":"4","author":"R\u00e9nyi A.","year":"1959","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"e_1_2_1_197_2","first-page":"385","article-title":"On connected graphs, I","volume":"4","author":"R\u00e9nyi A.","year":"1959","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"e_1_2_1_198_2","first-page":"5","article-title":"On the number of endpoints of a k\u2010tree","volume":"5","author":"R\u00e9nyi A.","year":"1970","journal-title":"Stud. Sci. Math. Hungar."},{"key":"e_1_2_1_199_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700004432"},{"key":"e_1_2_1_200_2","first-page":"945","volume-title":"Comb. Theory and its Appl. III, Belyai J\u00e1nos Natem. T\u00e4r., Budapest","author":"R\u00e9nyi I. C.","year":"1970"},{"key":"e_1_2_1_201_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90076-X"},{"issue":"7","key":"e_1_2_1_202_2","article-title":"On k\u2010connectedness of a r\u2010partite random graph","volume":"28","author":"Ruci\u0144ski A.","year":"1980","journal-title":"Bull. Acad. Polon. Sci. Ser. Sci. Math."},{"volume-title":"Probabilistic Methods in Combinatorial Analysis","year":"1978","author":"Sachkov V. N.","key":"e_1_2_1_203_2"},{"key":"e_1_2_1_204_2","first-page":"18","article-title":"The coverings of a random bipartite graph","volume":"6","author":"Saparov M.","year":"1973","journal-title":"Izv. Akad. Nauk Turkm. SSR. Ser. Fiz\u2010Techn. Chim. i. Geol. Nauk."},{"key":"e_1_2_1_205_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2496(73)90025-4"},{"key":"e_1_2_1_206_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.2044-8317.1975.tb00552.x"},{"key":"e_1_2_1_207_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01902105"},{"key":"e_1_2_1_208_2","article-title":"Limit theorems for complete subgraphs of random graphs","volume":"9","author":"Sch\u00fcrger K.","year":"1978","journal-title":"Period. Math. Hungar."},{"key":"e_1_2_1_209_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90008-5"},{"key":"e_1_2_1_210_2","first-page":"60","article-title":"Counting uniform hypergraphs with a simple cyclic structure","volume":"2","author":"Selivanov B. I.","year":"1972","journal-title":"Kombinatornyi Analiz"},{"key":"e_1_2_1_211_2","unstructured":"B. I.Selivanov Supplementary comments about uniform hypertrees and hyperforests.Kombinator. i Asimpt. Analiz Krasnoyarsk (1975)137\u2013146[in Russian]."},{"key":"e_1_2_1_212_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080307"},{"volume-title":"Lecture Notes in Math., No. 671","year":"1978","author":"Smythe R. T.","key":"e_1_2_1_213_2"},{"key":"e_1_2_1_214_2","doi-asserted-by":"publisher","DOI":"10.1137\/1114007"},{"key":"e_1_2_1_215_2","doi-asserted-by":"publisher","DOI":"10.1137\/1114052"},{"key":"e_1_2_1_216_2","doi-asserted-by":"publisher","DOI":"10.1137\/1115004"},{"key":"e_1_2_1_217_2","doi-asserted-by":"publisher","DOI":"10.1137\/1115027"},{"issue":"2","key":"e_1_2_1_218_2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/1117028","article-title":"The structure of random graphs Gm (x|h)","author":"Stepanov V. E.","year":"1972","journal-title":"Theory Prob. Appl."},{"key":"e_1_2_1_219_2","first-page":"164","volume-title":"Voprosy Kibernetiki","author":"Stepanov V. E.","year":"1973"},{"key":"e_1_2_1_220_2","first-page":"505","article-title":"Estimates of some parameters of finite graphs with applications","volume":"13","author":"Thanh Le Cong","year":"1977","journal-title":"Electr. Inform. Kyber."},{"volume-title":"Finite Automata; Behaviour and Synthesis","year":"1973","author":"Trahtenbrot B. A.","key":"e_1_2_1_221_2"},{"key":"e_1_2_1_222_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010307"},{"key":"e_1_2_1_223_2","first-page":"619","volume-title":"Reliability and fault tree analysis","author":"Van Slyke R.","year":"1975"},{"key":"e_1_2_1_224_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1972.1091214"},{"key":"e_1_2_1_225_2","first-page":"298","article-title":"Asymptotic enumeration of connected graphs","volume":"68","author":"Wight E. M.","year":"1970","journal-title":"Proc. Royal Soc. Edinburgh Ser. A"},{"key":"e_1_2_1_226_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1972-13097-0"},{"key":"e_1_2_1_227_2","doi-asserted-by":"publisher","DOI":"10.2307\/2038430"},{"key":"e_1_2_1_228_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1973-13307-5"},{"key":"e_1_2_1_229_2","doi-asserted-by":"publisher","DOI":"10.2307\/2039100"},{"key":"e_1_2_1_230_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-28.4.577"},{"key":"e_1_2_1_231_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90011-9"},{"key":"e_1_2_1_232_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-8.1.44"},{"key":"e_1_2_1_233_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0017089500002159"},{"key":"e_1_2_1_234_2","unstructured":"E. M.Wright The asymptotic enumeration of unlabelled graphs.Proc. 5th British Combinatorial Conference(1975)665\u2013677. (MR 52 #13484.)"},{"key":"e_1_2_1_235_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-11.1.13"},{"key":"e_1_2_1_236_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-14.3.554"},{"key":"e_1_2_1_237_2","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/8.3.241"},{"key":"e_1_2_1_238_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100051471"},{"key":"e_1_2_1_239_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100000207"},{"key":"e_1_2_1_240_2","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/28.3.363"},{"key":"e_1_2_1_241_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010407"},{"key":"e_1_2_1_242_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190020403"},{"key":"e_1_2_1_243_2","first-page":"107","volume-title":"Algoritm. Issled. Kombinator","author":"Zaitsev M. A.","year":"1978"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190060402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190060402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:51:49Z","timestamp":1737053509000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190060402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":244,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["10.1002\/jgt.3190060402"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190060402","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"type":"print","value":"0364-9024"},{"type":"electronic","value":"1097-0118"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}