A counterexample to a conjecture of Björner and Lovász on the χ-coloring complex

Shlomo Hoory; Nathan Linial

doi:10.1016/j.jctb.2005.06.008

A counterexample to a conjecture of Björner and Lovász on the χ-coloring complex

Shlomo Hoory^*
, Nathan Linial

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

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

9 Scopus citations

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.

Original language	English
Pages (from-to)	346-349
Number of pages	4
Journal	Journal of Combinatorial Theory. Series B
Volume	95
Issue number	2
DOIs	https://doi.org/10.1016/j.jctb.2005.06.008
State	Published - Nov 2005

Keywords

Coloring complex
Graph coloring
Graph homomorphism

Access to Document

10.1016/j.jctb.2005.06.008

Cite this

@article{f46799e3d4f741d298e7b8e1e2abd75f,

title = "A counterexample to a conjecture of Bj{\"o}rner and Lov{\'a}sz on the χ-coloring complex",

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{\"o}rner and Lov{\'a}sz, this graph G′ must be disconnected. In this note we give a counterexample to this conjecture.",

keywords = "Coloring complex, Graph coloring, Graph homomorphism",

author = "Shlomo Hoory and Nathan Linial",

year = "2005",

month = nov,

doi = "10.1016/j.jctb.2005.06.008",

language = "אנגלית",

volume = "95",

pages = "346--349",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - A counterexample to a conjecture of Björner and Lovász on the χ-coloring complex

AU - Hoory, Shlomo

AU - Linial, Nathan

PY - 2005/11

Y1 - 2005/11

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

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

KW - Coloring complex

KW - Graph coloring

KW - Graph homomorphism

UR - https://www.scopus.com/pages/publications/26944469981

U2 - 10.1016/j.jctb.2005.06.008

DO - 10.1016/j.jctb.2005.06.008

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

AN - SCOPUS:26944469981

SN - 0095-8956

VL - 95

SP - 346

EP - 349

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 2

ER -

A counterexample to a conjecture of Björner and Lovász on the χ-coloring complex

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this