Box complexes and homotopy theory of graphs
From MaRDI portal
Publication:1689736
DOI10.4310/HHA.2017.V19.N2.A10zbMATH Open1400.55010arXiv1605.06222OpenAlexW2964038319MaRDI QIDQ1689736FDOQ1689736
Authors: Takahiro Matsushita
Publication date: 17 January 2018
Published in: Homology, Homotopy and Applications (Search for Journal in Brave)
Abstract: We introduce a model structure on the category of graphs, which is Quillen equivalent to the category of -spaces. A weak equivalence is a graph homomorphism which induces a -homotopy equivalence between their box complexes. The box complex is a -space associated to a graph, considered in the context of the graph coloring problem. In the proof, we discuss the universality problem of the Hom complex.
Full work available at URL: https://arxiv.org/abs/1605.06222
Recommendations
Simplicial sets and complexes in algebraic topology (55U10) Coloring of graphs and hypergraphs (05C15)
Cited In (12)
- Box complexes, neighborhood complexes, and the chromatic number
- \(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture
- Homotopy types of box complexes of chordal graphs
- Graphs, foams, tensors, polytopes, and homology
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs
- Homotopy and Hom construction in the category of finite hypergraphs
- Topology and Adjunction in Promise Constraint Satisfaction
- (Lack of) model structures on the category of graphs
- A homotopy category for graphs
- The universality of Hom complexes of graphs
- Simplicial approximation and refinement of monoidal topological complexity
- Fundamental Groupoids for Graphs
This page was built for publication: Box complexes and homotopy theory of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689736)