Lilla Tóthmérész

From MaRDI portal
(Redirected from Person:1691091)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
Journal of Combinatorial Theory. Series A
2024-05-24Paper
\(h^*\) -vectors of graph polytopes using activities of dissecting spanning trees
Algebraic Combinatorics
2024-03-01Paper
The two-variable hypergraph Tutte polynomial via embedding activities2023-10-31Paper
Root polytopes and Jaeger‐type dissections for directed graphs
Mathematika
2023-09-20Paper
On approximating the rank of graph divisors
Discrete Mathematics
2023-06-12Paper
Degrees of interior polynomials and parking function enumerators2023-04-06Paper
Effective divisor classes on metric graphs
Mathematische Zeitschrift
2022-09-15Paper
Ehrhart theory of symmetric edge polytopes via ribbon structures2022-01-25Paper
Rotor-routing reachability is easy, chip-firing reachability is hard
European Journal of Combinatorics
2022-01-13Paper
Hypergraph polynomials and the Bernardi process
Algebraic Combinatorics
2020-10-14Paper
The devil's staircase for chip-firing on random graphs and on graphons2020-04-27Paper
Chip-firing based methods in the Riemann-Roch theory of directed graphs
European Journal of Combinatorics
2019-06-18Paper
The sandpile group of a trinity and a canonical definition for the planar Bernardi action2019-05-05Paper
On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs
The Electronic Journal of Combinatorics
2018-01-15Paper
On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs
The Electronic Journal of Combinatorics
2018-01-15Paper
Algorithmic aspects of rotor-routing and the notion of linear equivalence
Discrete Applied Mathematics
2018-01-11Paper
On the complexity of the chip-firing reachability problem
Proceedings of the American Mathematical Society
2017-06-22Paper
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
Discrete Applied Mathematics
2015-07-24Paper
Rotor-routing orbits in directed graphs and the Picard group2015-02-20Paper
On the combinatorics of suffix arrays
Information Processing Letters
2014-04-14Paper
A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Lilla Tóthmérész