math.CO — Combinatorics
Highly Connected Counterexamples to the Multiplicative Merino–Welsh Inequality
For every integer , we construct -connected matroids representable over every infinite field, with girth , arbitrarily large cogirth, and Merino–Welsh quotient \[ \Phi(M)=\frac{T_M(1,1)^2}{T_M(2,0)T_M(0,2)} \] tending to infinity. In particular, this disproves **Conjecture 7.2 of Csikvári (2026)**, which asserts the multiplicative Merino–Welsh inequality for simple and cosimple matroids, and therefore also the stronger **Conjecture 7.3** therein, as observed by its author. Our examples are rank truncations of direct sums of -element circuits. We give a 3-connected counterexample on 1011 elements of rank 433, certified by exact integer arithmetic, and a 6048-element counterexample admitting a proof without computation. Taking the direct sum of a counterexample with its dual also gives a negative answer to **Problem 4.3 of Beke, Csáji, Csikvári, and Pituk (2024)**: the original maximum and additive Merino–Welsh inequalities can fail for simple and cosimple matroids. The same construction disproves **Conjecture 2 of Knauer, Martínez-Sandoval, and Merino (2026)**: for every fixed , is unbounded even among matroids having both girth and cogirth exactly . The dual direct-sum examples need not be connected; these constructions do not disprove the graphical or binary versions.