Paths of homomorphisms from stable Kneser graphs
From MaRDI portal
Publication:485504
DOI10.1007/s00493-013-2749-9zbMath1313.05071arXiv1006.0474OpenAlexW2091829352MaRDI QIDQ485504
Publication date: 9 January 2015
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.0474
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- The equivariant topology of stable Kneser graphs
- Kneser's conjecture, chromatic number, and homotopy
- Symmetries of the stable Kneser graphs
- The universality of Hom complexes of graphs
- Hom complexes and homotopy theory in the category of graphs
- Graph colorings, spaces of edges and spaces of circuits
- A short proof of Kneser's conjecture
- Topology of Hom complexes and test graphs for bounding chromatic number
- Neighborhood complexes of stable Kneser graphs
- Complexes of graph homomorphisms
- Proof of the Lovász conjecture
- 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
This page was built for publication: Paths of homomorphisms from stable Kneser graphs
