Box complexes, neighborhood complexes, and the chromatic number
From MaRDI portal
Publication:1881691
DOI10.1016/j.jcta.2004.06.004zbMath1060.05029arXivmath/0310339OpenAlexW2097771028MaRDI QIDQ1881691
Arnold Wassmer, Péter Csorba, Ingo Schurr, Carsten E. M. C. Lange
Publication date: 14 October 2004
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0310339
Hypergraphs (05C65) Homotopy equivalences in algebraic topology (55P10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items
The neighborhood complex of a random graph, Warmth and edge spaces of graphs, Homomorphism complexes, reconfiguration, and homotopy for directed graphs, On the chromatic number of general Kneser hypergraphs, Colorful subgraphs in Kneser-like graphs, Small models of graph colouring manifolds and the Stiefel manifolds \(\Hom(C_{5},K_n)\), On topological relaxations of chromatic conjectures, Colinear Coloring on Graphs, Dold's theorem from viewpoint of strong compatibility graphs, On the Chromatic Number of Matching Kneser Graphs, WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences, On a topological relaxation of a conjecture of Erdős and Nešetřil
Cites Work
- Unnamed Item
- Bier spheres and barycentric subdivision
- A generalized Kneser conjecture
- Kneser's conjecture, chromatic number, and homotopy
- Topological lower bounds for the chromatic number: a hierarchy
- From graphs to ortholattices and equivariant maps
- The Chromatic Number of Kneser Hypergraphs
- Equivariant Cohomology and Lower Bounds for Chromatic Numbers
- 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
