{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T01:26:09Z","timestamp":1767921969427,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":[[1996,9]]},"DOI":"10.1007\/bf01261326","type":"journal-article","created":{"date-parts":[[2005,3,23]],"date-time":"2005-03-23T22:01:48Z","timestamp":1111615308000},"page":"417-431","source":"Crossref","is-referenced-by-count":108,"title":["Orthogonal representations over finite fields and the chromatic number of graphs"],"prefix":"10.1007","volume":"16","author":[{"given":"Ren\ufffd","family":"Peeters","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R. L. Brooks","year":"1941","unstructured":"R. L. Brooks: On colouring the nodes of a network,Proceedings of the Cambridge Philosophical Society,37 (1941), 194?197.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"CR2","series-title":"Ergebnisse der Mathematik","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"A. E. Brouwer","year":"1989","unstructured":"A. E. Brouwer, A. M. Cohen, andA. Neumaier:Distance-Regular Graphs, Ergebnisse der Mathematik 3.18, Springer, Heidelberg (1989)."},{"key":"CR3","unstructured":"S. Even:Graph Algorithms, Pitman, (1979)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson, andL. J. Stockmeyer: Some NP-Complete Graph Problems,Theor. Comput. Sci.,1 (1976), 237?267.","journal-title":"Theor. Comput. Sci."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","volume":"23","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, andD. S. Johnson: The Complexity of Near-Optimal Graph Coloring,J. ACM.,23 (1976), 43?49.","journal-title":"J. ACM."},{"key":"CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey, andD. S. Johnson:Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, (1979)."},{"issue":"2","key":"CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\ufffdtchel","year":"1981","unstructured":"M. Gr\ufffdtchel, L. Lov\ufffdsz, andA. Schrijver: The ellipsoid method and its consequences in combinatorial optimization,Combinatorica,1 (2) (1981), 169?197.","journal-title":"Combinatorica"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1109\/TIT.1979.1056027","volume":"25","author":"W. Haemers","year":"1979","unstructured":"W. Haemers: On the problems of Lov\ufffdsz concerning the Shannon capacity of a graph,IEEE Trans. Inform. Theory,25 (1979), 231?232.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR9","unstructured":"W. Haemers: An upper bound for the Shannon capacity of a graph,Colloqua Mathematica Societatis J\ufffdnos Bolyai,25, Algebraic Methods in Graph Theory, Szeged (Hungary), (1978), 267?272."},{"key":"CR10","unstructured":"D. Hershkowitz, andH. Schneider: Ranks of zero patterns and sign patterns, preprint, (1991)."},{"key":"CR11","first-page":"79","volume-title":"Graph Theory and its applications","author":"A. J. Hoffman","year":"1970","unstructured":"A. J. Hoffman: On eigenvalues and colorings of graphs, in B. Harris, Ed.,Graph Theory and its applications, New York and London: Academic, (1970), 79?91."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"D. E. Knuth: The Sandwich Theorem,Electronic J. Comb.,1 (1994), #A1.","DOI":"10.37236\/1193"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\ufffdsz","year":"1979","unstructured":"L. Lov\ufffdsz: On the Shannon capacity of a graph,IEEE Trans. Inform. Theory,25 (1979), 1?7.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR14","unstructured":"L. Lov\ufffdsz: An Algorithmic Theory of Numbers, Graphs and Convexity,CBMS Regional Conference Series in Applied Mathematics, SIAM, (1986) \ufffd3.2."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0024-3795(89)90475-8","volume":"114\/115","author":"L. Lov\ufffdsz","year":"1989","unstructured":"L. Lov\ufffdsz, M. Saks, andA. Schrijver: Orthogonal Representations and Connectivity of Graphs,Linear Algebra Appl.,114\/115 (1989), 439?454.","journal-title":"Linear Algebra Appl."},{"key":"CR16","unstructured":"C. H. Papadimitriou:Computational Complexity, Addison-Wesley Publ. Co., (1994)."},{"key":"CR17","unstructured":"R. Peeters:Ranks and Structure of Graphs, dissertation, Tilburg University, (1995)."},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02122698","volume":"10","author":"A. A. Razborov","year":"1990","unstructured":"A. A. Razborov: Applications of matrix methods to the theory of lower bounds in computational complexity,Combinatorica,10 (1) (1990), 81?93.","journal-title":"Combinatorica"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A. Schrijver","year":"1979","unstructured":"A. Schrijver: A comparison of the Delsarte and Lov\ufffdsz bounds,IEEE Trans. Inform. Theory,25 (1979), 425?429.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TIT.1956.1056774","volume":"3","author":"C. E. Shannon","year":"1956","unstructured":"C. E. Shannon: The zero-error capacity of a noisy channel,IRE Trans. Inform. Theory,3 (1956), 3?15.","journal-title":"IRE Trans. Inform. Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261326.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01261326\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T12:37:47Z","timestamp":1586176667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01261326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF01261326"],"URL":"https:\/\/doi.org\/10.1007\/bf01261326","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}