Homotopy types of Hom complexes of graphs
Takahiro Matsushita

TL;DR
This paper investigates the homotopy types of Hom complexes of graphs, revealing limitations of homotopy invariants in bounding graph chromatic numbers and exploring equivariant homotopy types.
Contribution
It demonstrates that no homotopy invariant of Hom complexes can upper bound the chromatic number, and constructs examples showing homotopy equivalence does not imply similar chromatic bounds.
Findings
Hom complexes' homotopy invariants do not bound chromatic number from above.
Existence of homotopy equivalent Hom complexes with significantly different chromatic numbers.
Analysis of equivariant homotopy types of Hom complexes.
Abstract
The Hom complex of graphs is a CW-complex associated to a pair of graphs and , considered in the graph coloring problem. It is known that certain homotopy invariants of give lower bounds for the chromatic number of . For a fixed finite graph , we show that there is no homotopy invariant of which gives an upper bound for the chromatic number of . More precisely, for a non-bipartite graph , we construct a graph such that and are homotopy equivalent but is much larger than . The equivariant homotopy type of is also considered.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Retinoids in leukemia and cellular processes · Homotopy and Cohomology in Algebraic Topology
