3 papers
math.CO2026
Joins and ear decompositions beyond graphic matroids
Yuhang Bai, Kristóf Bérczi, Chaitanya Nalam
For a matroid , a join is a set that meets every circuit in at most elements. Let denote the maximum size of a join. Motivated by Frank's mi…
math.CO2026
A hierarchy of edge-weight symmetries in perfect matchings
Kristóf Bérczi, Viktor Csaplár, Yutaro Yamaguchi
Motivated by the exact weight perfect matching problem and recent parameterized algorithms for finding an -th smallest perfect matching, we study structural properties of edg…
cs.DS2026
Above-Guarantee Algorithm for Properly Colored Trees
Yuhang Bai, Kristóf Bérczi
In the Properly Colored Spanning Tree problem, we are given an edge-colored undirected graph and the goal is to find a spanning tree in which any two adjacent edges have distinct c…