Approximating the rank of graph divisors is hard

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 theory is the rank of a divisor on a graph. Kiss and Tóthmérész reformulated the problem using chip-firing games, and showed that computing the rank of a…

Inverse stable matching problems

In stable marriage and stable roommates problems, it might happen that no stable solution exists, or stable solutions do not meet certain requirements. In such cases, one might be interested in modifying the instance so that the existence of a stable outcome with the desired properties is ensured. In a recent manuscript titled Manipulating the…

Updated website

We are happy to announce that the website of the research group got new features! We started an Open problems section where you can read about problems the research group is working on, while registered users can also write comments (the registration form is available through clicking on the three lines on the top left…

Basis exchanges in split matroids

The basis exchange axiom has been a driving force in the development of matroid theory. In our recent paper titled Exchange distance of basis pairs in split matroids, we study the distance of basis pairs of a matroid in terms of symmetric exchanges. In particular, we give an upper bound on the minimum number of…

Split matroids and hypergraphs

Our paper titled Hypergraph characterization of split matroids is now available on arXiv. The paper studies the structure of split matroids from a combinatorial point of view. We introduce the notion of elementary split matroids and give a hypergraph characterization in terms of independent sets. The proposed class is closed not only under duality and…