3 citations · 3 across the 1 of their papers we have counts for
3 papers
math.CO2022★ 3 cited
Ehrhart theory of symmetric edge polytopes via ribbon structures
Tamás Kálmán, Lilla Tóthmérész
Using a ribbon structure of the graph, we construct a dissection of the symmetric edge polytope of a graph into unimodular simplices. Our dissection is shellable, and one can inter…
math.CO2018
Hypergraph polynomials and the Bernardi process
Tamás Kálmán, Lilla Tóthmérész
Recently O. Bernardi gave a formula for the Tutte polynomial of a graph, based on spanning trees and activities just like the original definition, but using a fixed ribbon…
math.AG2018
Effective divisor classes on metric graphs
Andreas Gross, Farbod Shokrieh, Lilla Tóthmérész
We introduce the notion of semibreak divisors on metric graphs (tropical curves) and prove that every effective divisor class (of degree at most the genus) has a semibreak divisor…