{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:52:11Z","timestamp":1773820331614,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8508,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0012-365x(90)90149-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"171-175","source":"Crossref","is-referenced-by-count":117,"title":["On the independence number of random graphs"],"prefix":"10.1016","volume":"81","author":[{"given":"A.M.","family":"Frieze","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90149-C_BIB1","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0012-365X(90)90149-C_BIB2","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, The chromatic number of random graphs, Combinatorica, to appear.","DOI":"10.1007\/BF02122551"},{"key":"10.1016\/0012-365X(90)90149-C_BIB3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0305004100053056","article-title":"Cliques in random graphs","volume":"80","author":"Bollob\u00e1s","year":"1976","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"10.1016\/0012-365X(90)90149-C_BIB4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S0305004100051124","article-title":"On colouring random graphs","volume":"77","author":"Grimmett","year":"1975","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"10.1016\/0012-365X(90)90149-C_BIB5","first-page":"356","article-title":"On the complete subgraphs of a random graph","author":"Matula","year":"1970","journal-title":"Combinatory Mathematics and its Applications"},{"key":"10.1016\/0012-365X(90)90149-C_BIB6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02579304","article-title":"Expose and merge exploration and the chromatic number of a random graphs","volume":"7","author":"Matula","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(90)90149-C_BIB7","unstructured":"E. Shamir and J. Spencer, Sharp concentration of the chromatic number on random graphs Gn,p, Combinatorica, to appear."},{"key":"10.1016\/0012-365X(90)90149-C_BIB8","series-title":"Almost Sure Convergence","author":"Stout","year":"1974"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090149C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090149C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:53:16Z","timestamp":1555134796000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090149C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["0012365X9090149C"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90149-c","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}