On inverse powers of graphs and topological implications of Hedetniemi's conjecture

From MaRDI portal
Publication:2338641




Abstract: We consider a natural graph operation Omegak that is a certain inverse (formally: the right adjoint) to taking the k-th power of a graph. We show that it preserves the topology (the mathbbZ2-homotopy type) of the box complex, a basic tool in topological combinatorics. Moreover, we prove that the box complex of a graph G admits a mathbbZ2-map (an equivariant, continuous map) to the box complex of a graph H if and only if the graph Omegak(G) admits a homomorphism to H, for high enough k. This allows to show that if Hedetniemi's conjecture on the chromatic number of graph products were true for n-colorings, then the following analogous conjecture in topology would also also true: If X,Y are mathbbZ2-spaces (finite mathbbZ2-simplicial complexes) such that X x Y admits a mathbbZ2-map to the (n-2)-dimensional sphere, then X or Y itself admits such a map. We discuss this and other implications, arguing the importance of the topological conjecture.



Cites work







This page was built for publication: On inverse powers of graphs and topological implications of Hedetniemi's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2338641)