{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T03:28:58Z","timestamp":1772249338549,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0020-0190(02)00482-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"71-74","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["On the spectrum of projective norm-graphs"],"prefix":"10.1016","volume":"86","author":[{"given":"Tibor","family":"Szab\u00f3","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00482-9_BIB001","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02579382","article-title":"Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory","volume":"6","author":"Alon","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(02)00482-9_BIB002","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF03352998","article-title":"Constructive bounds for a Ramsey-type problem","volume":"13","author":"Alon","year":"1997","journal-title":"Graphs Combin."},{"key":"10.1016\/S0020-0190(02)00482-9_BIB003","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02809902","article-title":"Constructive lower bounds for off-diagonal Ramsey numbers","volume":"122","author":"Alon","year":"2001","journal-title":"Israel J. Math."},{"key":"10.1016\/S0020-0190(02)00482-9_BIB004","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/jctb.1999.1906","article-title":"Norm-graphs: variations and applications","volume":"76","author":"Alon","year":"1999","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0020-0190(02)00482-9_BIB005","unstructured":"N. Alon, V. R\u00f6dl, Asymptotically tight bounds for some multicolored Ramsey numbers, submitted"},{"key":"10.1016\/S0020-0190(02)00482-9_BIB006","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"issue":"1","key":"10.1016\/S0020-0190(02)00482-9_BIB007","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jctb.1999.1948","article-title":"On generalized Ramsey theory: the bipartite case","volume":"79","author":"Axenovich","year":"2000","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0020-0190(02)00482-9_BIB008","series-title":"Proc. 28th Annual ACM Symposium on the Theory of Computing (STOC)","first-page":"603","article-title":"Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs","author":"Babai","year":"1996"},{"key":"10.1016\/S0020-0190(02)00482-9_BIB009","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF01261323","article-title":"Norm-graphs and bipartite Tur\u00e1n numbers","volume":"16","author":"Koll\u00e1r","year":"1996","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/S0020-0190(02)00482-9_BIB010","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0963548301005028","article-title":"Some exact results and new asymptotics for hypergraph Tur\u00e1n numbers","volume":"11","author":"Mubayi","year":"2002","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0020-0190(02)00482-9_BIB011","series-title":"Equations over Finite Fields, An Elementary Approach","volume":"536","author":"Schmidt","year":"1976"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004829?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004829?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T08:29:26Z","timestamp":1718440166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0020019002004829"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00482-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the spectrum of projective norm-graphs","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(02)00482-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Science B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}