The Rank and Size of Graphs

Journal of Graph Theory

Volumn 23, Issue 2, 1996, Pages 185-189

  Kotlov, Andrew ^a   Lovász, László ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1542580113     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199610)23:2<185::AID-JGT9>3.0.CO;2-P     Document Type: Article

References (10)

1. N. Alon and P. Seymour, A counterexample to the rank-coloring conjecture, J. Graph Theory 13 (1989), 523-525.
2. S. Fajtlowicz, on conjectures of graffiti, Discrete Math. 72 (1988), 113-118.
3. P. M. Gruber and J. M. Wills (eds.), Handbook of Convex Geometry, Volume B. Amsterdam, North-Holland (1993).
4. G. A. Kabatjanskiǐ and V. I. Levienštein, Bounds for packings on a sphere and in space, Problemy Peredachi Informatsii 14 (1978), 3-25. [Russian]
5. A. Kotlov, Rank and chromatic number of a graph, preprint.
6. L. Lovász, Communication complexity: a survey, in: Paths, flows, and VLSI-Layout, (ed. B. Korte, L. Lovász, H. J. Prömel, A. Schrijver), Springer (1990), 235-265.
7. N. Nisan and A. Wigderson, On rank vs. communication complexity. Proc. the 35th FOCS (1994), 831-836.
8. R. Raz and B. Spieker, On the log-rank conjecture in communication complexity. Proc. of the 34th FOCS (1993), 168-176.
9. A. Razborov, The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear, Discrete Math. 108 (1992), 393-396.
10. C. van Nuffelen, A bound for the chromatic number of a graph, Amer. Math. Monthly 83 (1976), 265-266.