Description
EGERVÁRY SZEMINÁRIUM
Absztrakt: I will talk about a graph polytope (the root polytope) and a polynomial associated to it (the interior polynomial). The root polytope has an interesting relationship to polymatroids. The interior polynomial has nice properties and it generalizes some known graph polynomials (for example T(x,1) where T(x,y) is the Tutte polynomial, and also the greedoid polynomial of the branching greedoid of a planar eulerian digraph). We show how the degree of the interior polynomial can be connected to the structure of the graph. Joint work with Tamás Kálmán.