{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:12:39Z","timestamp":1743059559094,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":78,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461472575"},{"type":"electronic","value":"9781461472582"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4614-7258-2_23","type":"book-chapter","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T18:28:13Z","timestamp":1375381693000},"page":"371-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Origins of the Theory of Random Graphs"],"prefix":"10.1007","author":[{"given":"Micha\u0142","family":"Karo\u0144ski","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,20]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.4007\/annals.2005.162.1335","volume":"162","author":"D. Achlioptas","year":"2005","unstructured":"D. Achlioptas and A. Naor, The two possible values of the chromatic number of a random graph, Ann. of Math. 162(2) (2005), no. 3, 1335\u20131351.","journal-title":"Ann. of Math."},{"key":"23_CR2","first-page":"293","volume":"14","author":"M Ajtai","year":"1979","unstructured":"M. Ajtai, J. Koml\u00f3s and E. Szemer\u00e9di, Topological complete subgraphs in random graphs, Studia. Sci. Math. Hungar. 14 (1979), 293\u2013297.","journal-title":"Studia. Sci. Math. Hungar."},{"key":"23_CR3","unstructured":"N. Alon and J. Spencer, The Probabilistic Method, 1992, Wiley."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1017\/S0963548300000559","volume":"2","author":"N Alon","year":"1993","unstructured":"N. Alon and R. Yuster, Threshold functions forH-factors, Combinatorics, Probability and Computing 2 (1993), 137\u2013144.","journal-title":"Combinatorics, Probability and Computing"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1017\/S0305004100059995","volume":"92","author":"AD Barbour","year":"1982","unstructured":"A.D. Barbour, Poisson convergence and random graphs, Math. Proc. Cambr. Phil. Soc. 92 (1982), 349\u2013359.","journal-title":"Math. Proc. Cambr. Phil. Soc."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1002\/rsa.3240010403","volume":"1","author":"AD Barbour","year":"1990","unstructured":"A.D. Barbour, S. Janson, M. Karo\u0144ski and A. Ruci\u0144ski, Small cliques in random graphs, Random Structures Alg. 1 (1990), 403\u2013434.","journal-title":"Random Structures Alg."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0095-8956(89)90014-2","volume":"47","author":"AD Barbour","year":"1989","unstructured":"A.D. Barbour, M. Karo\u0144ski and A.Ruci\u0144ski, A central limit theorem for decomposable random variables with applications to random graphs, J. Comb. Th.-B 47 (1989), 125\u2013145.","journal-title":"J. Comb. Th.-B"},{"key":"23_CR8","unstructured":"P. Billingsley, Probability and Measure, 1979, Wiley."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1017\/S0305004100058655","volume":"90","author":"B Bollob\u00e1s","year":"1981","unstructured":"B. Bollob\u00e1s, Threshold functions for small subgraphs, Math. Proc. Cambr. Phil. Soc. 90 (1981), 197\u2013206.","journal-title":"Math. Proc. Cambr. Phil. Soc."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/jgt.3190060209","volume":"6","author":"B Bollob\u00e1s","year":"1982","unstructured":"B. Bollob\u00e1s, Vertices of given degree in a random graph, J. Graph Theory 6 (1982), 147\u2013155.","journal-title":"J. Graph Theory"},{"key":"23_CR11","first-page":"33","volume":"13","author":"B Bollob\u00e1s","year":"1982","unstructured":"B. Bollob\u00e1s, Distinguishing vertices of random graphs, Annals Discrete Math. 13 (1982), 33\u201350.","journal-title":"Annals Discrete Math."},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0195-6698(83)80039-0","volume":"4","author":"B Bollob\u00e1s","year":"1983","unstructured":"B. Bollob\u00e1s, Almost all regular graphs are Hamiltonian, Europ. J. Combinatorics 4 (1983), 97\u2013106.","journal-title":"Europ. J. Combinatorics"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.2307\/1999405","volume":"286","author":"B Bollob\u00e1s","year":"1984","unstructured":"B. Bollob\u00e1s, The evolution of random graphs, Trans. Amer. Math. Soc. 286 (1984), 257\u2013274.","journal-title":"Trans. Amer. Math. Soc."},{"key":"23_CR14","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s, Random Graphs, Academic Press, London, 1985."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02122551","volume":"8","author":"B Bollob\u00e1s","year":"1988","unstructured":"B. Bollob\u00e1s, The chromatic number of random graphs, Combinatorica 8 (1988), 49\u201355.","journal-title":"Combinatorica"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B Bollob\u00e1s","year":"1976","unstructured":"B. Bollob\u00e1s and P. Erd\u0151s, Cliques in random graphs, Math. Proc. Cambr. Phil. Soc. 80 (1976), 419\u2013427.","journal-title":"Math. Proc. Cambr. Phil. Soc."},{"key":"23_CR17","first-page":"1","volume":"28","author":"B Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s and A. Frieze, On matchings and hamiltonian cycles in random graphs, in: Random Graphs \u201983, Annals of Discrete Mathematics 28 (1985), 1\u20135.","journal-title":"Annals of Discrete Mathematics"},{"key":"23_CR18","first-page":"47","volume":"28","author":"B Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s and A. Thomason, Random graphs of small order, Annals of Discrete Math. 28 (1985), 47\u201398.","journal-title":"Annals of Discrete Math."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02579198","volume":"7","author":"B Bollob\u00e1s","year":"1987","unstructured":"B. Bollob\u00e1s and A. Thomason, Threshold functions, Combinatorica 7 (1987), 35\u201338.","journal-title":"Combinatorica"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s and J.C. Wierman, Subgraph counts and containment probabilities of balanced and unbalanced subgraphs in a large random graph, in: Graph Theory and Its Applications: East and West (Proc. 1st China-USA Intern. Graph Theory Conf.), Eds. Capobianco et al., Annals of the New York Academy of Sciences 576 (1989), 63\u201370.","DOI":"10.1111\/j.1749-6632.1989.tb16383.x"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"R. DeMarco and J. Kahn, Tight upper tail bounds for cliques\n                41 (2012), 469487.","DOI":"10.1002\/rsa.20440"},{"key":"23_CR22","doi-asserted-by":"crossref","first-page":"P48","DOI":"10.37236\/535","volume":"18","author":"A. Dudek","year":"2011","unstructured":"[DFl] A. Dudek and A. Frieze, Loose Hamilton Cycles in Random k-Uniform Hypergraphs Electronic Journal of Combinatorics, 18 (2011) P48.","journal-title":"Electronic Journal of Combinatorics"},{"key":"23_CR23","unstructured":"A. Dudek and A. Frieze, Tight Hamilton Cycles in Random Uniform Hypergraphs, Random Structures Alg., to appear."},{"key":"23_CR24","doi-asserted-by":"crossref","first-page":"P44","DOI":"10.37236\/2523","volume":"19","author":"A Dudek","year":"2012","unstructured":"A. Dudek, A. Frieze, P.-S. Loh and S. Speiss, Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs, Electronic Journal of Combinatorics 19 (2012), P44.","journal-title":"Electronic Journal of Combinatorics"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P Erd\u0151s","year":"1947","unstructured":"P. Erd\u0151s, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292\u2013294.","journal-title":"Bull. Amer. Math. Soc."},{"key":"23_CR26","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s and A. R\u00e9nyi, On random graphs I, Publ. Math. Debrecen 6 (1959), 290\u2013297.","journal-title":"Publ. Math. Debrecen"},{"key":"23_CR27","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"P. Erd\u0151s and A. R\u00e9nyi On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960), 17\u201361.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"23_CR28","first-page":"343","volume":"38","author":"P Erd\u0151s","year":"1961","unstructured":"P. Erd\u0151s and A. R\u00e9nyi, On the evolution of random graphs, Bull. Inst. Internat. Statist. 38 (1961), 343\u2013347.","journal-title":"Bull. Inst. Internat. Statist."},{"key":"23_CR29","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02066689","volume":"12","author":"P Erd\u0151s","year":"1961","unstructured":"P. Erd\u0151s and A. R\u00e9nyi, On the strength of connectedness of a random graph, Acta Math. Acad. Sci. Hungar. 12 (1961), 261\u2013267.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"23_CR30","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01895716","volume":"14","author":"P Erd\u0151s","year":"1963","unstructured":"P. Erd\u0151s and A. R\u00e9nyi, Asymmetric graphs, Acta Math. Acad. Sci. Hung. 14 (1963), 295\u2013315.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"23_CR31","first-page":"455","volume":"8","author":"P Erd\u0151s","year":"1964","unstructured":"P. Erd\u0151s and A. R\u00e9nyi, On random matrices, Publ. Math. Inst. Hung. Acad. Sci. 8 (1964), 455\u2013461.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01894879","volume":"17","author":"P Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s and A. R\u00e9nyi, On the existence of a factor of degree one of a connected random graph, Acta Math. Acad. Sci. Hung. 17 (1966), 359\u2013368.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"23_CR33","first-page":"459","volume":"3","author":"P Erd\u0151s","year":"1968","unstructured":"P. Erd\u0151s and A. R\u00e9nyi On random matrices II, Studia Sci. Math. Hung. 3 (1968), 459\u2013464.","journal-title":"Studia Sci. Math. Hung."},{"key":"23_CR34","doi-asserted-by":"crossref","first-page":"N28","DOI":"10.37236\/477","volume":"17","author":"A. Frieze","year":"2010","unstructured":"A. Frieze Loose Hamilton Cycles in Random 3-Uniform Hypergraphs Electronic Journal of Combinatorics 17 (2010) N28","journal-title":"Electronic Journal of Combinatorics"},{"key":"23_CR35","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/rsa.3240070104","volume":"7","author":"A Frieze","year":"1995","unstructured":"A. Frieze and S. Janson, Perfect Matchings in Random s-Uniform Hypergraphs Random Structures and Algorithms 7 (1995) 41\u201357.","journal-title":"Random Structures and Algorithms"},{"key":"23_CR36","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"E N Gilbert","year":"1959","unstructured":"E. N. Gilbert, Random graphs, Annals of Mathematical Statistics 30 (1959), 1141\u20131144.","journal-title":"Annals of Mathematical Statistics"},{"key":"23_CR37","first-page":"271","volume":"28","author":"E Godehardt","year":"1981","unstructured":"E. Godehardt and J. Steinebach, On a lemma of P. Erd\u0151s and A. R\u00e9nyi about random graphs, Publ. Math. 28 (1981), 271\u2013273.","journal-title":"Publ. Math."},{"key":"23_CR38","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"GR Grimmett","year":"1975","unstructured":"G.R. Grimmett and C.J.H. McDiarmid, On colouring random graphs, Math. Proc. Cambr. Phil. Soc. 77 (1975), 313\u2013324.","journal-title":"Math. Proc. Cambr. Phil. Soc."},{"key":"23_CR39","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/rsa.3240010209","volume":"1","author":"S Janson","year":"1990","unstructured":"S. Janson, Poisson approximation for large deviations, Random Structures & Algorithms 1 (1990), 221\u2013229.","journal-title":"Random Structures & Algorithms"},{"key":"23_CR40","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/rsa.3240040303","volume":"4","author":"S Janson","year":"1993","unstructured":"S. Janson, D.E. Knuth, T. \u0141uczak and B. Pittel, The birth of the giant component, Random Structures & Algorithms 4 (1993), 233\u2013358.","journal-title":"Random Structures & Algorithms"},{"key":"23_CR41","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/rsa.3240020205","volume":"2","author":"S Janson","year":"1991","unstructured":"S. Janson and J. Kratochvil, Proportional graphs, Random Structures & Algorithms 2 (1991), 209\u2013224.","journal-title":"Random Structures & Algorithms"},{"key":"23_CR42","first-page":"73","volume-title":"An exponential bound for the probability of nonexistence of a specified subgraph of a random graph, in: Proceedings of Random Graphs \u201987","author":"S Janson","year":"1990","unstructured":"S. Janson, T. \u0141uczak and A.Ruci\u0144ski, An exponential bound for the probability of nonexistence of a specified subgraph of a random graph, in: Proceedings of Random Graphs \u201987, Wiley, Chichester, 1990, 73\u201387."},{"key":"23_CR43","doi-asserted-by":"crossref","unstructured":"S. Janson, T. \u0141uczak and A. Ruci\u0144ski, Random Graphs Wiley, (2000).","DOI":"10.1002\/9781118032718"},{"key":"23_CR44","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02771528","volume":"141","author":"S Janson","year":"2004","unstructured":"S. Janson, K. Oleszkiewicz and A. Ruci\u0144ski, Upper tails for subgraph counts in random graphs, Israel J. Math. 141 (2004), 61\u201392.","journal-title":"Israel J. Math."},{"key":"23_CR45","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/rsa.3240030203","volume":"3","author":"S Janson","year":"1992","unstructured":"S. Janson and J. Spencer, Probabilistic constructions of proportional graphs, Random Structures & Algorithms 3 (1992), 127\u2013137.","journal-title":"Random Structures & Algorithms"},{"key":"23_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20224","volume":"33","author":"A Johansson","year":"2008","unstructured":"A. Johansson, J. Kahn and V. Vu, Factors in random graphs, Random Structures and Algorithms 33 (2008), 1\u201328.","journal-title":"Random Structures and Algorithms"},{"key":"23_CR47","first-page":"197","volume":"2","author":"M Karo\u0144ski","year":"1982","unstructured":"M. Karo\u0144ski, On the number of k-trees in a random graph, Prob. Math. Stat., 2 (1982), 197\u2013205.","journal-title":"Prob. Math. Stat."},{"key":"23_CR48","doi-asserted-by":"crossref","unstructured":"M. Karo\u0144ski and A. Ruci\u0144ski, On the number of strictly balanced subgraphs of a random graph, in: Graph Theory, \u0141ag\u00f3w 1981, Lecture Notes in Math. 1018, Springer-Verlag, 1983, 79\u201383.","DOI":"10.1007\/BFb0071616"},{"key":"23_CR49","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/jgt.3190170209","volume":"17","author":"J K\u00e4rrman","year":"1993","unstructured":"J. K\u00e4rrman, Existence of proportional graphs, J. Graph Theory 17 (1993), 207\u2013220.","journal-title":"J. Graph Theory"},{"issue":"2","key":"23_CR50","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/rsa.10093","volume":"23","author":"J H Kim","year":"2003","unstructured":"J. H. Kim, Perfect matchings in random uniform hypergraphs, Random Struct. Algorithms 23(2) (2003), 111\u2013132","journal-title":"Random Struct. Algorithms"},{"key":"23_CR51","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1137\/1131058","volume":"31","author":"VF Kolchin","year":"1986","unstructured":"V.F. Kolchin, On the limit behavior of a random graph near the critical point, Theory Probability Its Appl. 31 (1986), 439\u2013451.","journal-title":"Theory Probability Its Appl."},{"key":"23_CR52","doi-asserted-by":"publisher","first-page":"317334","DOI":"10.1002\/(SICI)1098-2418(199610)9:3<317::AID-RSA4>3.0.CO;2-#","volume":"9","author":"M Krivelevich","year":"1996","unstructured":"M. Krivelevich, Perfect fractional matchings in random hypergraphs, Random Structures and Algorithms 9 (1996), 317334.","journal-title":"Random Structures and Algorithms"},{"key":"23_CR53","first-page":"337347","volume":"6","author":"M Krivelevich","year":"1997","unstructured":"M. Krivelevich, Triangle factors in random graphs, Combinatorics, Probability and Computing 6 (1997), 337347.","journal-title":"Probability and Computing"},{"key":"23_CR54","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","volume":"43","author":"J Koml\u00f3s","year":"1983","unstructured":"J. Koml\u00f3s and E. Szemer\u00e9di, Limit distributions for the existence of Hamilton cycles, Discrete Math. 43 (1983), 55\u201363.","journal-title":"Discrete Math."},{"key":"23_CR55","first-page":"17","volume":"31","author":"AD Korshunov","year":"1977","unstructured":"A.D. Korshunov, A solution of a problem of Erd\u0151s and R\u00e9nyi on Hamilton cycles in non-oriented graphs, Metody Diskr. Anal. 31 (1977), 17\u201356.","journal-title":"Metody Diskr. Anal."},{"key":"23_CR56","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0305004100065646","volume":"104","author":"T \u0141uczak","year":"1988","unstructured":"T. \u0141uczak, The automorphism group of random graphs with a given number of edges, Math. Proc. Camb. Phil. Soc. 104 (1988), 441\u2013449.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"23_CR57","first-page":"377","volume":"10","author":"T \u0141uczak","year":"1990","unstructured":"T. \u0141uczak, On the chromatic number of sparse random graphs, Combinatorica 10 (1990), 377\u2013385.","journal-title":"Combinatorica"},{"key":"23_CR58","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/rsa.3240010305","volume":"1","author":"T \u0141uczak","year":"1990","unstructured":"T. \u0141uczak, Component behavior near the critical point of the random graph process, Random Structures & Algorithms 1 (1990), 287\u2013310.","journal-title":"Random Structures & Algorithms"},{"key":"23_CR59","first-page":"151","volume-title":"On the equivalence of two basic models of random graphs, in: Proceedings of Random Graphs \u201987","author":"T \u0141uczak","year":"1990","unstructured":"T. \u0141uczak, On the equivalence of two basic models of random graphs, in: Proceedings of Random Graphs \u201987, Wiley, Chichester, 1990, 151\u2013157."},{"key":"23_CR60","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0012-365X(91)90162-U","volume":"91","author":"T \u0141uczak","year":"1991","unstructured":"T. \u0141uczak, Size and connectivity of the k-core of a random graph, Discrete Math. 91 (1991) 61\u201368.","journal-title":"Discrete Math."},{"key":"23_CR61","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01205080","volume":"11","author":"T \u0141uczak","year":"1991","unstructured":"T. \u0141uczak, A note on the sharp concentration of the chromatic number of a random graph, Combinatorica 11 (1991), 295\u2013297.","journal-title":"Combinatorica"},{"key":"23_CR62","unstructured":"T. \u0141uczak, The phase transition in a random graph, Combinatorics, Paul Erd\u0151s is Eighty, vol.2 (Dezs\u00e4 Mikl\u00f3s, Vera T.S\u00f3s, Tam\u00e1s Sz\u00f5nyi, eds.), Budapest, 1996, Bolyai Society Mathematical Studies 2, 399\u2013422."},{"key":"23_CR63","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02122682","volume":"9","author":"T \u0141uczak","year":"1989","unstructured":"T. \u0141uczak and J.C. Wierman, The chromatic number of random graphs at the double-jump threshold, Combinatorica 9 (1989), 39\u201349.","journal-title":"Combinatorica"},{"key":"23_CR64","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1090\/S0002-9947-1994-1138950-5","volume":"341","author":"T \u0141uczak","year":"1994","unstructured":"T. \u0141uczak, B. Pittel and J.C. Wierman, The structure of a random graph at the double-jump threshold, Trans. Am. Math. Soc. 341 (1994), 721\u2013728.","journal-title":"Trans. Am. Math. Soc."},{"key":"23_CR65","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1137\/0404011","volume":"4","author":"T \u0141uczak","year":"1991","unstructured":"T. \u0141uczak and A. Ruci\u0144ski, Tree-matchings in random graph processes, SIAM J. Discr. Math 4 (1991), 107\u2013120.","journal-title":"SIAM J. Discr. Math"},{"key":"23_CR66","unstructured":"D. W. Matula, The employee party problem, Notices Amer. Math. Soc. 19 (1972), A-382"},{"key":"23_CR67","unstructured":"D. W. Matula, The largest clique size in a random graph, Tech. Rep. Dept. Comput. Sci., Southern Methodist Univ., Dallas, 1976."},{"key":"23_CR68","unstructured":"D. W. Matula and L. Kucera, An expose-and-merge algorithm and the chromatic number of a random graph, in: Random Graphs \u201987 (J. Jaworski, M. Karo\u0144ski and A. Ruci\u0144ski, eds.), John Wiley & Sons, New York, 1990, 175\u2013188."},{"key":"23_CR69","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"L P\u00f3sa","year":"1976","unstructured":"L. P\u00f3sa, Hamiltonian circuits in random graphs, Discrete Math. 14 (1976), 359\u2013364.","journal-title":"Discrete Math."},{"key":"23_CR70","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00718031","volume":"78","author":"A Ruci\u0144ski","year":"1988","unstructured":"A. Ruci\u0144ski, When are small subgraphs of a random graph normally distributed?, Prob. Th. Rel. Fields 78 (1988), 1\u201310.","journal-title":"Prob. Th. Rel. Fields"},{"key":"23_CR71","first-page":"283","volume-title":"Small subgraphs of random graphs: a survey, in: Proceedings of Random Graphs \u201987","author":"A Ruci\u0144ski","year":"1990","unstructured":"A. Ruci\u0144ski, Small subgraphs of random graphs: a survey, in: Proceedings of Random Graphs \u201987, Wiley, Chichester, 1990, 283\u2013303."},{"key":"23_CR72","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0012-365X(92)90141-2","volume":"105","author":"A Ruci\u0144ski","year":"1992","unstructured":"A. Ruci\u0144ski, Matching and covering the vertices of a random graph by copies of a given graph, Discrete Math. 105 (1992), 185\u2013197.","journal-title":"Discrete Math."},{"key":"23_CR73","first-page":"181","volume":"49","author":"A Ruci\u0144ski","year":"1985","unstructured":"A. Ruci\u0144ski and A. Vince, Balanced graphs and the problem of subgraphs of random graphs, Congres. Numerantium 49 (1985), 181\u2013190.","journal-title":"Congres. Numerantium"},{"key":"23_CR74","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02018372","volume":"10","author":"K Sch\u00fcrger","year":"1979","unstructured":"K. Sch\u00fcrger, Limit theorems for complete subgraphs of random graphs, Period. Math. Hungar. 10 (1979), 47\u201353.","journal-title":"Period. Math. Hungar."},{"key":"23_CR75","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0012-365X(83)90044-4","volume":"45","author":"J Schmidt","year":"1983","unstructured":"J. Schmidt and E. Shamir, A threshold for perfect matchings in random d-pure hypergraphs, Discrete Math. 45 (1983), 287\u2013295.","journal-title":"Discrete Math."},{"key":"23_CR76","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02579208","volume":"7","author":"E Shamir","year":"1987","unstructured":"E. Shamir and J. Spencer, Sharp concentration of the chromatic number of random graphsG\n                \n                  n,\u2009p\n                , Combinatorica 7 (1987), 121\u2013129.","journal-title":"Combinatorica"},{"key":"23_CR77","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/BF02761675","volume":"39","author":"E Shamir","year":"1981","unstructured":"E. Shamir and E. Upfal, On factors in random graphs, Israel J. Math.39 (1981), 296\u2013302.","journal-title":"Israel J. Math."},{"key":"23_CR78","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1017\/S0017089500002159","volume":"15","author":"E M Wright","year":"1974","unstructured":"E. M. Wright, Asymmetric and symmetric graphs, Glasgow Math. J. 15 (1974), 69\u201373.","journal-title":"Glasgow Math. J."}],"container-title":["The Mathematics of Paul Erd\u0151s I"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-7258-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T14:36:11Z","timestamp":1676817371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-7258-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781461472575","9781461472582"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-7258-2_23","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"20 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}