Around the Merino--Welsh conjecture: improving Jackson's inequality
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908840106131456 |
|---|---|
| author | Csikvári, Péter |
| author_facet | Csikvári, Péter |
| contents | The Merino-Welsh conjecture states that for a graph $G$ without loops and bridges the Tutte polynomial $T_G(x,y)$ satisfies the inequality $$\max(T_G(2,0),T_G(0,2))\geqslant T_G(1,1).$$ Later Jackson proved that for any matroid $M$ without loops and coloops we have $$T_M(3,0)T_M(0,3)\geqslant T_M(1,1)^2.$$ The value $3$ in this statement was improved to $2.9243$ by Beke, Csáji, Csikvári and Pituk. In this paper, we further improve on this result by showing that $$T_M(2.355,0)T_M(0,2.355)\geqslant T_M(1,1)^2.$$ We also prove that the Merino--Welsh conjecture is true for matroids $M$, where all circuits of $M$ and its dual $M^*$ have length between $\ell$ and $(\ell-2)^2(\ell^2-4\ell+2)$ for some $\ell\geqslant 4$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_19196 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Around the Merino--Welsh conjecture: improving Jackson's inequality Csikvári, Péter Combinatorics The Merino-Welsh conjecture states that for a graph $G$ without loops and bridges the Tutte polynomial $T_G(x,y)$ satisfies the inequality $$\max(T_G(2,0),T_G(0,2))\geqslant T_G(1,1).$$ Later Jackson proved that for any matroid $M$ without loops and coloops we have $$T_M(3,0)T_M(0,3)\geqslant T_M(1,1)^2.$$ The value $3$ in this statement was improved to $2.9243$ by Beke, Csáji, Csikvári and Pituk. In this paper, we further improve on this result by showing that $$T_M(2.355,0)T_M(0,2.355)\geqslant T_M(1,1)^2.$$ We also prove that the Merino--Welsh conjecture is true for matroids $M$, where all circuits of $M$ and its dual $M^*$ have length between $\ell$ and $(\ell-2)^2(\ell^2-4\ell+2)$ for some $\ell\geqslant 4$. |
| title | Around the Merino--Welsh conjecture: improving Jackson's inequality |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2502.19196 |