A counterexample to a conjecture of Björner and Lovász on the χ-coloring complex
Shlomo Hoory, Nathan Linial
Abstract
Associated with every graph G of chromatic number χ is another graph G'. The vertex set of G' consists of all χ-colorings of G, and two χ-colorings are adjacent when they differ on exactly one vertex. According to a conjecture of Björner and Lovász, this graph G' must be disconnected. In this note we give a counterexample to this conjecture.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.