14 citations · 18 across the 6 of their papers we have counts for
7 papers
-vectors of graph polytopes using activities of dissecting spanning trees
Tamás Kálmán, Lilla Tóthmérész
Symmetric edge polytopes of graphs and root polytopes of semi-balanced digraphs are two classes of lattice polytopes whose -polynomials have interesting properties and general…
On Ryser's conjecture for t-intersecting and degree-bounded hypergraphs
Zoltan Kiraly, Lilla Tothmeresz
A famous conjecture (usually called Ryser's conjecture) that appeared in the Ph.D thesis of his student, J.~R.~Henderson [15], states that for an -uniform -partite hypergraph…
Chip-firing based methods in the Riemann--Roch theory of directed graphs
Bálint Hujter, Lilla Tóthmérész
Baker and Norine proved a Riemann--Roch theorem for divisors on undirected graphs. The notions of graph divisor theory are in duality with the notions of the chip-firing game of Bj…
Algorithmic aspects of rotor-routing and the notion of linear equivalence
Lilla Tóthmérész
We define the analogue of linear equivalence of graph divisors for the rotor-router model, and use it to prove polynomial time computability of some problems related to rotor-routi…
Rotor-routing orbits in directed graphs and the Picard group
Lilla Tóthmérész
In [5], Holroyd, Levine, Mészáros, Peres, Propp and Wilson characterize recurrent chip-and-rotor configurations for strongly connected digraphs. However, the number of steps needed…
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
Viktor Kiss, Lilla Tóthmérész
Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing t…
On the combinatorics of suffix arrays
Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette
We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our…