Metraipolis › archive › dc_401b76e0e1ae

An inequality for the number of independent sets of matroids with an application to the forest-tree ratio of graphs — arXiv:2609.18611

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18611
License (as archived)
CC0-1.0
Archived
2026-10-15T16:13:07.095Z
SHA-256 of the archived text
a90940e940578dadc1bd34d4757863adc5d7f60d32147e0c667662aef6d6c644
Stable URL of this page
https://metraipolis.com/documento/dc_401b76e0e1ae

How to cite

An inequality for the number of independent sets of matroids with an application to the forest-tree ratio of graphs — arXiv:2609.18611 — arXiv (en), https://arxiv.org/abs/2609.18611 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_401b76e0e1ae (Metraipolis archive dc_401b76e0e1ae, sha256 a90940e940578dadc1bd34d4757863adc5d7f60d32147e0c667662aef6d6c644)
BibTeX
@misc{dc401b76e0e1ae,
  title = {An inequality for the number of independent sets of matroids with an application to the forest-tree ratio of graphs — arXiv:2609.18611},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18611},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_401b76e0e1ae; sha256 a90940e940578dadc1bd34d4757863adc5d7f60d32147e0c667662aef6d6c644},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18611. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $M=(E,\mathcal{I})$ be a matroid of rank $r$. Let $\mathcal{I}_k$ be the independent sets of size $k$, and let $I_k=|\mathcal{I}_k|$ and $I=|\mathcal{I}|$. We show that if every set $F\in \mathcal{I}_{r-1}$ is contained in at least $\delta$ bases, then $$\ln \left(\frac{I}{I_r}\right)\geqslant \frac{I_{r-1}}{I_r}\cdot \delta \ln \left(1+\frac{1}{\delta}\right).$$ In particular, we have $$\frac{I}{I_r}\geqslant 2^{I_{r-1}/I_r}.$$ By combining this result with several other ideas, we prove that if $G$ is a simple connected graph on $n$ vertices, and $F(G)$ and $T(G)$ denote its numbers of spanning forests and spanning trees, respectively, then $$\frac{F(G)}{T(G)}\geqslant \frac{F(K_n)}{T(K_n)},$$ where $K_n$ is the complete graph on $n$ vertices. Equality holds if and only if $G=K_n$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.18611 — 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-15T15:38:58.244Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).