Tutte-polynomial inequality for simple co-simple matroids

Let MM be a matroid. A matroid is simple if it has no loops or parallel elements, and co-simple if its dual has no loops or parallel elements. Simple co-simple matroid conjecture. Every simple co-simple matroid satisfies

TM(2,0)TM(0,2)TM(1,1)2.T_M(2,0)T_M(0,2)\geq T_M(1,1)^2.

This would follow immediately from the preceding bipartite graph conjecture via the transfer argument. It is an open matroidal strengthening of Jackson's inequality, with the supplied text giving no resolution.

Sources & referencesView supporting material

Primary source

Péter Csikvári, “Around the Merino–Welsh conjecture: improving Jackson's inequality”, arXiv:2502.19196 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.