Showing math.COShow all
2 papers · 1 filter
math.CO2025
Minimum maximal matchings in permutahedra
Sofia Brenner, Jiří Fink, Hung. P. Hoang +2
We prove that the minimal size of a maximal matching in the permutahedron is asymptotically . On the one hand, we obtain a lower bound $M(π_n) \ge n! (n-1) / (…
math.CO2022
On approximating the rank of graph divisors
Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész
Baker and Norine initiated the study of graph divisors as a graph-theoretic analogue of the Riemann-Roch theory for Riemann surfaces. One of the key concepts of graph divisor theor…