Circuits and cuts in binary matroids

Our paper titled Rainbow and monochromatic circuits and cuts in binary matroids has been accepted for publication in Discrete Mathematics! We show that if a binary matroid of rank r is colored with exactly r colors, then M either contains a rainbow colored circuit or a monochromatic cut. As the class of binary matroids is…

Welcome back!

Hey, welcome to 2022! We start this year by introducing a new member of the group: Attila Bernáth, a former member of the Department of Operations Research and of the Egerváry Research Group is joining us for a few months! We hope to come back with good news on rainbow colored arborescences – we’ll see…

Goodbye 2021

Similarly to 2020, the past year was no ordinary either. However, we got the opportunity to form the research group, and there are plenty of open problems to work on! We’ll start the next year with some interesting results on split matroids, so stay tuned! See you in 2022!

Success at the Scientific Students’ Associations Conference

The Scientific Students’ Associations Conference, that looks back on a history of six decades, is organized in every academic year. The conference provides a great opportunity for talented young students to introduce themselves and to present their research to a wide audience. Last Friday, several junior members of the research group gave talks at this…

Popular assignments at SODA

Tamás Király and his co-authors (Kavitha, Matuschke, Schlotter and Schmidt-Kraepelin) considered the popular assignment problem, a generalization of the well-studied popular matching problem. Their paper titled The popular assignment problem: when cardinality is more important than popularity has been accepted to SODA 2022. Congratulations!