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.
β¦ LIBER β¦
Counterexamples to the List Square Coloring Conjecture
β Scribed by Kim, Seog-Jin; Park, Boram
- Book ID
- 121731842
- Publisher
- John Wiley and Sons
- Year
- 2014
- Tongue
- English
- Weight
- 284 KB
- Volume
- 78
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A counterexample to the rank-coloring co
β
N. Alon; P. D. Seymour
π
Article
π
1989
π
John Wiley and Sons
π
English
β 140 KB
Counterexamples to the BaumβConnes conje
β
N. Higson; V. Lafforgue; G. Skandalis
π
Article
π
2002
π
Springer
π
English
β 273 KB
Counterexamples to the correlated stabil
β
Friess, Joshua J.; Gubser, Steven S.; Mitra, Indrajit
π
Article
π
2005
π
The American Physical Society
π
English
β 310 KB
List-coloring the square of a subcubic g
β
Daniel W. Cranston; Seog-Jin Kim
π
Article
π
2007
π
John Wiley and Sons
π
English
β 266 KB
π 1 views
## Abstract The __square__ __G__^2^ of a graph __G__ is the graph with the same vertex set __G__ and with two vertices adjacent if their distance in __G__ is at most 2. Thomassen showed that every planar graph __G__ with maximum degree Ξ(__G__)β=β3 satisfies Ο(__G__^2^)ββ€β7. Kostochka and Woodall c
A counterexample to the triangle conject
β
P.W Shor
π
Article
π
1985
π
Elsevier Science
π
English
β 107 KB
A counterexample to the dimension conjec
β
V. K. Beloshapka
π
Article
π
2007
π
SP MAIK Nauka/Interperiodica
π
English
β 383 KB