Cobounding odd cycle colorings
classification
🧮 math.AT
math.CO
keywords
babson-kozlovcharacteristicclasscoboundarycoboundingcochaincoloringscombinatorial
read the original abstract
We give a very short self-contained combinatorial proof of the Babson-Kozlov conjecture, by presenting a cochain whose coboundary is the desired power of the characteristic class.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.