User Tools

Site Tools


Marcelo Aguiar (Cornell)

The Ring of Graphs and the Chromatic Polynomial

Abstract for the Combinatorics Seminar 2014 February 25

Certain basic operations between graphs resemble addition and multiplication of ordinary numbers. Formally, the species of graphs is a ring in an appropriate category. We explain this fact and employ it to obtain a novel understanding and a wide generalization of the chromatic polynomial (and the corresponding symmetric function of Stanley) in terms of ring theory.

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