A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex

DOI10.1016/j.jctb.2005.06.008zbMath1075.05036arXivmath/0405339OpenAlexW1993582455MaRDI QIDQ2573652

Nathan Linial, Shlomo Hoory

Publication date: 22 November 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0405339

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs ⋮ The equivariant topology of stable Kneser graphs ⋮ Answers to some problems about graph coloring test graphs ⋮ Paths of homomorphisms from stable Kneser graphs ⋮ Topology of Hom complexes and test graphs for bounding chromatic number ⋮ Graph colorings, spaces of edges and spaces of circuits ⋮ Homotopy types of the Hom complexes of graphs

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Complexes of graph homomorphisms
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

This page was built for publication: A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex