Orthogonal representations over finite fields and the chromatic number of graphs

Combinatorica

Volumn 16, Issue 3, 1996, Pages 417-431

  Peeters, René ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041350906     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01261326     Document Type: Article

References (20)

1. R. L. BROOKS: On colouring the nodes of a network, Proceedings of the Cambridge Philosophical Society, 37 (1941), 194-197.
2. A. E. BROUWER, A. M. COHEN, and A. NEUMAIER: Distance-Regular Graphs, Ergebnisse der Mathematik 3.18, Springer, Heidelberg (1989).
3. S. EVEN: Graph Algorithms, Pitman, (1979).
4. M. R. GAREY, D. S. JOHNSON, and L. J. STOCKMEYER: Some NP-Complete Graph Problems, Theor. Comput. Sci., 1 (1976), 237-267.
5. M. R. GAREY, and D. S. JOHNSON: The Complexity of Near-Optimal Graph Coloring, J. ACM., 23 (1976), 43-49.
6. M. R. GAREY, and D. S. JOHNSON: Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, (1979).
7. M. GRÖTCHEL, L. LOVÁSZ, and A. SCHRIJVER: The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (2) (1981), 169-197.
8. W. HAEMERS: On the problems of Lovász concerning the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), 231-232.
9. W. HAEMERS: An upper bound for the Shannon capacity of a graph, Colloqua Mathematica Societatis János Bolyai, 25, Algebraic Methods in Graph Theory, Szeged (Hungary), (1978), 267-272.
10. D. HERSHKOWITZ, and H. SCHNEIDER: Ranks of zero patterns and sign patterns, preprint, (1991).
11. 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.
12. D. E. KNUTH: The Sandwich Theorem, Electronic J. Comb., 1 (1994), #A1.
13. L. LOVÁSZ: On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), 1-7.
14. L. LOVÁSZ: An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS Regional Conference Series in Applied Mathematics, SIAM, (1986) § 3.2.
15. L. LOVÁSZ, M. SAKS, and A. SCHRIJVER: Orthogonal Representations and Connectivity of Graphs, Linear Algebra Appl., 114/115 (1989), 439-454.
16. C. H. PAPADIMITRIOU: Computational Complexity, Addison-Wesley Publ. Co., (1994).
17. R. PEETERS: Ranks and Structure of Graphs, dissertation, Tilburg University, (1995).
18. A. A. RAZBOROV: Applications of matrix methods to the theory of lower bounds in computational complexity, Combinatorica, 10 (1) (1990), 81-93.
19. A. SCHRIJVER: A comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory, 25 (1979), 425-429.
20. C. E. SHANNON: The zero-error capacity of a noisy channel, IRE Trans. Inform. Theory, 3 (1956), 3-15.