Metraipolis › archive › dc_a8be959c2cfa
Quantitative Merino--Welsh inequalities for joins — arXiv:2609.33680
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.33680
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:29:07.181Z
- SHA-256 of the archived text
3bb2e77e4384a0fb994b63eb075f33f01cdafb7693a756bc5063c2759f7c9d1b- Stable URL of this page
https://metraipolis.com/documento/dc_a8be959c2cfa
How to cite
Quantitative Merino--Welsh inequalities for joins — arXiv:2609.33680 — arXiv (en), https://arxiv.org/abs/2609.33680 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a8be959c2cfa (Metraipolis archive dc_a8be959c2cfa, sha256 3bb2e77e4384a0fb994b63eb075f33f01cdafb7693a756bc5063c2759f7c9d1b)
BibTeX
@misc{dca8be959c2cfa,
title = {Quantitative Merino--Welsh inequalities for joins — arXiv:2609.33680},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.33680},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a8be959c2cfa; sha256 3bb2e77e4384a0fb994b63eb075f33f01cdafb7693a756bc5063c2759f7c9d1b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33680. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a connected graph \(G\), let \[ Q(G)=\frac{T(G;2,0)T(G;0,2)}{T(G;1,1)^2}. \] We obtain quantitative lower bounds for \(Q\) under the graph join operation. If \(A\) and \(B\) are arbitrary simple graphs of orders \(3\le a\le b\), then \(Q(A\vee B)\) admits an explicit lower bound depending only on \(a\) and \(b\), and this bound is strictly greater than \(1\). We further quantify the improvement produced by edges inside the two factors. For every simple graph \(F\), with \(n=|V(F)|+2\ge4\), we prove \[ Q(K_2\vee F)\ge \frac{27}{n^2}\left(\frac32\right)^{n-4}. \] Consequently, every join of at least three nonempty factors, and every complete multipartite graph with at least one edge and no cut edges, satisfies the strict multiplicative Merino--Welsh inequality. The proofs combine orientation estimates with spanning-tree comparisons based on effective resistance and block elimination.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.33680 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T23:08:10.819Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).