3 citations · 4 across the 5 of their papers we have counts for
7 papers
Reconfiguration of basis pairs in regular matroids
Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
In recent years, combinatorial reconfiguration problems have attracted great attention due to their connection to various topics such as optimization, counting, enumeration, or sam…
Reconfiguration of the Union of Arborescences
Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
An arborescence in a digraph is an acyclic arc subset in which every vertex execpt a root has exactly one incoming arc. In this paper, we reveal the reconfigurability of the union…
Weighted exchange distance of basis pairs
Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
Two pairs of disjoint bases and of a matroid are called equivalent if can be transformed into by…
Exchange distance of basis pairs in split matroids
Kristóf Bérczi, Tamás Schwarcz
The basis exchange axiom has been a driving force in the development of matroid theory. However, the axiom gives only a local characterization of the relation of bases, which is a…
Rainbow and monochromatic circuits and cuts in binary matroids
Kristóf Bérczi, Tamás Schwarcz
Given a matroid together with a coloring of its ground set, a subset of its elements is called rainbow colored if no two of its elements have the same color. We show that if a bina…
List colouring of two matroids through reduction to partition matroids
Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
In the list coloring problem for two matroids, we are given matroids and on the same ground set , and the goal is to determine the smal…
Complexity of packing common bases in matroids
Kristóf Bérczi, Tamás Schwarcz
One of the most intriguing unsolved questions of matroid optimization is the characterization of the existence of disjoint common bases of two matroids. The significance of the…