I work in extremal and probabilistic combinatorics. More recently, I have had two main focuses in my research: the MaxCut problem and first-order convergence laws in certain structured permutation classes.
A cut in a graph refers to a partition of the vertex set into two disjoint subsets, and the size of a cut is the number of edges crossing between the two subsets. The MaxCut-problem seeks to determine the maximum possible size of such a cut. A similar notion applies to hypergraphs, though in this case, there are notions of cuts which involve more than two parts. The MaxCut problem, and its closely related variants (bisection width, positive discrepancy) also have a variety of applications in theoretical computer science.
Recently, my research has been focused on problems related to the following more general question: Given a graph G with certain density, what sort of lower bounds can be proved on the size of the largest cut? Together with my collaborators, we improved the previous lower bounds on the positive discrepancy on graphs, on a certain type of MaxCut on hypergraphs, and on bisection width and positive discrepancy on sparse hypergraphs. While the underlying questions considered are purely combinatorial, these papers combine traditional tools from extremal and probabilistic combinatorics with rather involved arguments from linear algebra.
In 2025, I received a Swedish Research Council Starting Grant for the project Diskrepans och andra extremala problem för grafer.
For the full list of publications and preprints, see my personal website.
Short bio:
During autumn 2025, I was one of the lecturers in Foundations of Logic and Model Theory -course run by the CS department. In addition, I was helping with running Inledande kurs för kandidatprogrammet i matematik -course.
Since 2023, I have also been involved in running the Problemlösning och tävlingsmatematik -program.