{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:07:39Z","timestamp":1762175259224},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":7594,"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":[[1992,10]]},"DOI":"10.1016\/0012-365x(92)90691-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"393-396","source":"Crossref","is-referenced-by-count":23,"title":["The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear"],"prefix":"10.1016","volume":"108","author":[{"given":"A.A.","family":"Razborov","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90691-8_BIB1","doi-asserted-by":"crossref","unstructured":"N. Alon and P.D. Seymour, A counterexample to the rank-coloring conjecture, J. Graph Theory, to appear.","DOI":"10.1002\/jgt.3190130413"},{"key":"10.1016\/0012-365X(92)90691-8_BIB2","series-title":"Theory and Application","article-title":"Spectra of Graphs","author":"Cvetkovic","year":"1980"},{"key":"10.1016\/0012-365X(92)90691-8_BIB3","first-page":"300","article-title":"Lower bounds for VLSI","author":"Lipton","year":"1981","journal-title":"proc. 13th ACM STOC"},{"key":"10.1016\/0012-365X(92)90691-8_BIB4","first-page":"81","article-title":"Lattices, M\u00f6bius functions and communication complexity","author":"Lov\u00e1sz","year":"1988","journal-title":"Proc. 29th IEEE FOCS"},{"key":"10.1016\/0012-365X(92)90691-8_BIB5","first-page":"330","article-title":"Las Vegas is better than determinism in VLSI and distributive computing","author":"Mehlhorn","year":"1982","journal-title":"Proc. 14th ACM STOC"},{"key":"10.1016\/0012-365X(92)90691-8_BIB6","first-page":"209","article-title":"Some complexity questions related to distributed computing","author":"Yao","year":"1979","journal-title":"Proc. 11th ACM STOC"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92906918?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92906918?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:50:28Z","timestamp":1555120228000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X92906918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0012365X92906918"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90691-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}