In this talk, we discuss connections between commutative algebra and graph coloring theory. Given a graph, one can define an algebraic object called the stable set ideal. The question of when this ideal is generated by quadratic binomials is linked to the classical graph-theoretical concept of Kempe equivalence. By using this result, we give an algebraic method to examine Kempe equivalence.
Back to Long Programs
Copyright. All Rights Reserved.