User Tools

Site Tools


Garry Bowlin (Binghamton)

Frustrated Gain Graphs and Stanley's Chromatic Symmetric Function

Abstract for the Combinatorics Seminar 2007 April 24

In traditional gain graph colorings, the coloring set is G x [k] or G x [k] union {0}. To generalize this we will use arbitrary sets Q, where G acts on Q. Rather than counting proper colorings, we will count fully frustrated states. I will conclude with some examples and a deletion contraction formula for Stanley's Chromatic Symmetric Function. This talk is based on two articles of Thomas Zaslavsky.

seminars/comb/abstract.200704bow.txt · Last modified: 2020/01/29 14:03 (external edit)