Cobounding odd cycle colorings

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We prove that the (n − 2)nd power of the Stiefel-Whitney class of the space of all n-colorings of an odd cycle is 0 by presenting a cochain whose coboundary is the desired power of the class. This gives a very short self-contained combinatorial proof of a conjecture by Babson and the author. © 2006 American Mathematical Society.

References Powered by Scopus

77Citations
18Readers
Get full text

Topological obstructions to graph colorings

13Citations
11Readers

Cited by Powered by Scopus

7Citations
6Readers

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kozlov, D. N. (2006). Cobounding odd cycle colorings. Electronic Research Announcements of the American Mathematical Society, 12(7), 53–55. https://doi.org/10.1090/S1079-6762-06-00161-2

Readers' Seniority

Tooltip

Professor / Associate Prof. 3

60%

Lecturer / Post doc 1

20%

Researcher 1

20%

Readers' Discipline

Tooltip

Mathematics 3

60%

Agricultural and Biological Sciences 1

20%

Computer Science 1

20%

Save time finding and organizing research with Mendeley

Sign up for free