{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T18:21:27Z","timestamp":1771352487654,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":[[1991,3]]},"DOI":"10.1007\/bf01375472","type":"journal-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T15:19:45Z","timestamp":1112368785000},"page":"45-54","source":"Crossref","is-referenced-by-count":118,"title":["The chromatic number of random graphs"],"prefix":"10.1007","volume":"11","author":[{"given":"Tomasz","family":"\u0141uczak","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01375472_CR1","doi-asserted-by":"crossref","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\u201356.","journal-title":"Combinatorica"},{"key":"BF01375472_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(90)90149-C","volume":"81","author":"A. M. Frieze","year":"1990","unstructured":"A. M. Frieze: On the independence number of random graphs,Disc. Math.,81 (1990), 171\u2013175.","journal-title":"Disc. Math."},{"key":"BF01375472_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02579304","volume":"7","author":"D. Matula","year":"1987","unstructured":"D. Matula: Expose-and-merge exploration and the chromatic number of a random graph,Combinatorica,7 (1987), 275\u2013284.","journal-title":"Combinatorica"},{"key":"BF01375472_CR4","first-page":"175","volume-title":"Proceedings of Random Graphs '87","author":"D. Matula","year":"1990","unstructured":"D. Matula, andL. Ku\u010dera: An expose-and-merge algorithm and the chromatic number of a random graph, in \u201cProceedings of Random Graphs '87\u201d, Wiley, Chichester, 1990, 175\u2013188."},{"key":"BF01375472_CR5","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/BF02579208","volume":"7","author":"E. Shamir","year":"1987","unstructured":"E. Shamir, andJ. Spencer: Sharp concentration of the chromatic number on random graphsG n, p ,Combinatorica,7 (1987), 124\u2013129","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01375472.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01375472\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01375472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:21:53Z","timestamp":1556796113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01375472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF01375472"],"URL":"https:\/\/doi.org\/10.1007\/bf01375472","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}