Divisors on graphs and connected flags

Graph Theory Seminar
Thursday, November 15, 2012 - 12:05
1 hour (actually 50 minutes)
Skiles 005
Math, GT
Associated to every finite graph G there is a canonical ideal which encodes the linear equivalences of divisors on G. In the study of this ideal the concept of "connected flags" arise naturally. The focus of this talk will be the study of combinatorial properties of these connected flags. This is a joint work with Fatemeh Mohammadi. (This talk is related to the talk I gave on October 12th in the Combinatorics seminar, but I will not assume anything from the previous talk.)