{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T07:36:16Z","timestamp":1775633776304,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1007\/bf02122682","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T11:12:28Z","timestamp":1126696348000},"page":"39-49","source":"Crossref","is-referenced-by-count":17,"title":["The chromatic number of random graphs at the double-jump threshold"],"prefix":"10.1007","volume":"9","author":[{"given":"T.","family":"\u0141uczak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. C.","family":"Wierman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02122682_CR1","first-page":"293","volume":"14","author":"M. Ajtai","year":"1979","unstructured":"M. Ajtai, J. Koml\u00f3s andE. Szemer\u00e9di (1979), Topological complete subgraphs in random graphs,Studia Scientiarum Mathematicarum Hungarica 14, 293\u2013297.","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"BF02122682_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","volume":"1","author":"M. Ajtai","year":"1981","unstructured":"M. Ajtai, J. Koml\u00f3s andE. Szemer\u00e9di (1981), The longest path in a random graph,Combinatorica 1, 1\u201312.","journal-title":"Combinatorica"},{"key":"BF02122682_CR3","unstructured":"B.Bollob\u00e1s (1984), The evolution of sparse graphs,Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conf. in honour of Paul Erd\u00f6s (B. Bollob\u00e1s, ed.), Academic Press, 35\u201357."},{"key":"BF02122682_CR4","unstructured":"B.Bollob\u00e1s (1985),Random Graphs. Academic Press."},{"key":"BF02122682_CR5","first-page":"376","volume":"23","author":"A. Cayley","year":"1889","unstructured":"A. Cayley (1889), A theorem on trees.Quart. J. Pure Appl. Math. 23, 376\u2013378, orMath. Papers 13, 26\u201328.","journal-title":"Quart. J. Pure Appl. Math."},{"key":"BF02122682_CR6","first-page":"17","volume":"5","author":"P. Erd\u00f6s","year":"1960","unstructured":"P. Erd\u00f6s andA. R\u00e9nyi (1960), On the evolution of random graphs,Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 5, 17\u201361.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"BF02122682_CR7","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1214\/aoms\/1177728496","volume":"26","author":"L. Katz","year":"1955","unstructured":"L. Katz (1955), The probability of indecomposability of a random mapping function,Ann. Math. Stat. 26, 512\u2013517.","journal-title":"Ann. Math. Stat."},{"key":"BF02122682_CR8","unstructured":"E.Palmer (1985),Graphical Evolution: An Introduction to the Theory of Random Graphs, John Wiley and Sons."},{"key":"BF02122682_CR9","first-page":"385","volume":"4","author":"A. R\u00e9nyi","year":"1959","unstructured":"A. R\u00e9nyi (1959), On connected graphs I,Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 4, 385\u2013388.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"BF02122682_CR10","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/0095-8956(82)90004-1","volume":"32","author":"H. J. Voss","year":"1982","unstructured":"H. J. Voss (1982), Graphs having circuits with at least two chords,J. Comb. Theory Ser. B 32, 264\u2013285.","journal-title":"J. Comb. Theory Ser. B"},{"key":"BF02122682_CR11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/jgt.3190040409","volume":"4","author":"E. M. Wright","year":"1980","unstructured":"E. M. Wright (1980), The number of connected sparsely edged graphs III. Asymptotic results.J. Graph Theory 4, 393\u2013407.","journal-title":"J. Graph Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122682.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02122682\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:22:30Z","timestamp":1557796950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02122682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["BF02122682"],"URL":"https:\/\/doi.org\/10.1007\/bf02122682","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}