A counterexample to the rank‐coloring conjecture

N. Alon; P. D. Seymour

doi:10.1002/jgt.3190130413

A counterexample to the rank‐coloring conjecture

N. Alon^*, P. D. Seymour

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	523-525
Number of pages	3
Journal	Journal of Graph Theory
Volume	13
Issue number	4
DOIs	https://doi.org/10.1002/jgt.3190130413
State	Published - Sep 1989

Access to Document

10.1002/jgt.3190130413

Cite this

@article{d7218d13d8dd4186b0fc50f4246a0349,

title = "A counterexample to the rank‐coloring conjecture",

abstract = "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.",

author = "N. Alon and Seymour, {P. D.}",

year = "1989",

month = sep,

doi = "10.1002/jgt.3190130413",

language = "אנגלית",

volume = "13",

pages = "523--525",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "4",

}

TY - JOUR

T1 - A counterexample to the rank‐coloring conjecture

AU - Alon, N.

AU - Seymour, P. D.

PY - 1989/9

Y1 - 1989/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84986505748&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190130413

DO - 10.1002/jgt.3190130413

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84986505748

SN - 0364-9024

VL - 13

SP - 523

EP - 525

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 4

ER -

A counterexample to the rank‐coloring conjecture

Abstract

Access to Document

Other files and links

Fingerprint

Cite this