| |||||||||||||||||||||
At the interface of algebra, combinatorics, and statistics is the study of toric ideals associated with edge cuts of graphs. This generalizes the situation encountered in the study of phylogenetic trees. The talk will address the problem of finding degree bounds on minimal generating sets for toric ideals associated to the edge cuts of a outerplanar graph in partial answer to a conjecture of Sturmfels and Sullivant.
Refreshments at 4:00 pm in ES 152.