  |
Items where Author is "Tóthmérész, Lilla"
Group by: Item Type | No Grouping Jump to: Article Number of items: 8. ArticleTóthmérész, Lilla (2024) A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids. JOURNAL OF COMBINATORIAL THEORY SERIES A, 206. No.-105891. ISSN 0097-3165 Kálmán, Tamás and Tóthmérész, Lilla (2024) h^*-vectors of graph polytopes using activities of dissecting spanning trees. ALGEBRAIC COMBINATORICS. ISSN 2589-5486 (In Press) Bérczi, Kristóf and Hoang, Hung P. and Tóthmérész, Lilla (2023) On approximating the rank of graph divisors. DISCRETE MATHEMATICS, 346 (9). ISSN 0012-365X Gross, Andreas and Shokrieh, Farbod and Tóthmérész, Lilla (2022) Effective divisor classes on metric graphs. MATHEMATISCHE ZEITSCHRIFT. ISSN 0025-5874 Kálmán, Tamás and Tóthmérész, Lilla (2022) Root polytopes and Jaeger‐type dissections for directed graphs. MATHEMATIKA, 68 (4). pp. 1176-1220. ISSN 0025-5793 Tóthmérész, Lilla (2022) Rotor-routing reachability is easy, chip-firing reachability is hard. EUROPEAN JOURNAL OF COMBINATORICS, 101. ISSN 0195-6698 Tamás, Kálmán and Seunghun, Lee and Tóthmérész, Lilla (2022) The sandpile group of a trinity and a canonical definition for the planar Bernardi action. COMBINATORICA, 42. pp. 1283-1316. ISSN 0209-9683 Hujter, Bálint and Kiss, Viktor and Tóthmérész, Lilla (2017) ON THE COMPLEXITY OF THE CHIP-FIRING REACHABILITY PROBLEM. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 145 (8). pp. 3343-3356. ISSN 0002-9939 |
