A counterexample to the rank‐coloring conjecture

N. Alon*, P. D. Seymour

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


It has been conjectured by C. van Nuffelen that the chromatic number of any graph with at least one edge does not exceed the rank of its adjacency matrix. We give a counterexample, with chromatic number 32 and with an adjacency matrix of rank 29.

Original languageEnglish
Pages (from-to)523-525
Number of pages3
JournalJournal of Graph Theory
Issue number4
StatePublished - Sep 1989


Dive into the research topics of 'A counterexample to the rank‐coloring conjecture'. Together they form a unique fingerprint.

Cite this