Graph colorings, spaces of edges and spaces of circuits
From MaRDI portal
Publication:1028347
DOI10.1016/j.aim.2009.03.006zbMath1172.57001arXivmath/0606763MaRDI QIDQ1028347
Publication date: 30 June 2009
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0606763
57M15: Relations of low-dimensional topology with graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Hom complexes and homotopy in the category of graphs, Deformation retracts of neighborhood complexes of stable Kneser graphs, Stiefel manifolds and coloring the pentagon, Answers to some problems about graph coloring test graphs, Paths of homomorphisms from stable Kneser graphs, The equivariant topology of stable Kneser graphs, Set partition complexes, On the topological lower bound for the multichromatic number, Homotopy groups of Hom complexes of graphs, Topology of Hom complexes and test graphs for bounding chromatic number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Combinatorial groupoids, cubical complexes, and the Lovász Conjecture
- Canonical homeomorphisms of posets
- Topology of Hom complexes and test graphs for bounding chromatic number
- Complexes of graph homomorphisms
- Proof of the Lovász conjecture
- Small models of graph colouring manifolds and the Stiefel manifolds \(\Hom(C_{5},K_n)\)
- The homotopy type of complexes of graph homomorphisms between cycles
- A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex
- Cohomology of colorings of cycles
- On the Kunneth Formula and Functorial Dependence in Algebraic Topology
- 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
