2 papers
math.AG2026
Divisors and harmonic morphisms on metric graphs of pseudocompact type
Benjamin Mascuch, Montserrat Teixidor i Bigas
A metric graph is of pseudocompact type if identifying parallel edges produces a tree. We give a constructive proof that, for such graphs, divisorial -gonality is equivalent to…
math.CO2024
Extremal number of arborescences
Aditya Bandekar, Péter Csikvári, Benjamin Mascuch +3
In this paper we study the following extremal graph theoretic problem: Given an undirected Eulerian graph , which Eulerian orientation minimizes or maximizes the number of arbor…