activity
20062022
most citedRoot polytopes, Tutte polynomials, and a duality theorem for bipartite graphs

23 citations · 47 across the 10 of their papers we have counts for

collaborators

13 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.CO2021★ 5 cited

Root polytopes and Jaeger-type dissections for directed graphs

Tamás Kálmán, Lilla Tóthmérész

We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has t…

math.SG2019★ 1 cited

Ruling invariants for Legendrian graphs

Byung Hee An, Youngjin Bae, Tamás Kálmán

We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the f…

math.CO2019

The sandpile group of a trinity and a canonical definition for the planar Bernardi action

Tamás Kálmán, Seunghun Lee, Lilla Tóthmérész

Baker and Wang define the so-called Bernardi action of the sandpile group of a ribbon graph on the set of its spanning trees. This potentially depends on a fixed vertex of the grap…

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.CO2018★ 1 cited

Clock theorems for triangulated surfaces

Camden Hine, Tamás Kálmán

We investigate triangulations of the two-dimensional sphere and torus with the faces properly colored white and black. We focus on matchings between white triangles and incident ve…