3 citations · 6 across the 18 of their papers we have counts for
4 papers · 1 filter
Permutation Tutte polynomial
Csongor Beke, Gergely Kál Csáji, Péter Csikvári +1
The classical Tutte polynomial is a two-variate polynomial associated to graphs or more generally, matroids. In this paper, we introduce a polynomial $\widetilde{T}_H(x,…
The Merino--Welsh conjecture is false for matroids
Csongor Beke, Gergely Kál Csáji, Péter Csikvári +1
The matroidal version of the Merino--Welsh conjecture states that the Tutte polynomial of any matroid without loops and coloops satisfies that $$\max(T_M(2,0),T_M(0,…
On the complexity of packing rainbow spanning trees
Kristóf Bérczi, Gergely Csáji, Tamás Király
One of the most important questions in matroid optimization is to find disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list o…
Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial
Csongor Beke, Gergely Kál Csáji, Péter Csikvári +1
In this short note we show that a system with a ground set of size and (rank) function satisfying for ev…