Homology tests for graph colorings
Dmitry N. Kozlov
Abstract
We describe a simple homological test for obstructions to graph colorings. The main idea is to combine the framework of Hom-complexes with the following general fact: an arbitrary Z2-space has nontrivial homology with Z2-coefficients in the dimension equal to its Stiefel-Whitney height. Actually, as a result we have a whole family of homology tests, one for each test graph. In general, these tests will give different answers, depending heavily on the choice of the test graph. We illustrate this phenomenon with some examples.
Create a lesson
Related papers
Koszul duality and Morita categories
Max Blans
Persistence Meets Resistance: Doubling Down on Hardness
Benedikt Kolbe, Tim Mayr
On orientability, Poincaré duality, and connectivity of GKM graphs
Oliver Goertsches, Panagiotis Konstantis, Leopold Zoller
Local Bousfield classes via homological support
Tobias Barthel, Natalia Castellana, Drew Heard et al.
Coordinate-Deletion Bundles from Composition Algebras: Hopf Defects, KO-Classes, and Real Projective Space
Marina Palaisti
The product rule in Goodwillie calculus
Max Blans, Thomas Blom