Metraipolis › archive › dc_f733729c38de
An extremal theorem for non-isomorphic spanning trees — arXiv:2609.30201
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30201
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:41:05.730Z
- SHA-256 of the archived text
c775289da8014954ac4d1d749ba1afd3cb466fefbd26155b27db09beab464079- Stable URL of this page
https://metraipolis.com/documento/dc_f733729c38de
How to cite
An extremal theorem for non-isomorphic spanning trees — arXiv:2609.30201 — arXiv (en), https://arxiv.org/abs/2609.30201 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f733729c38de (Metraipolis archive dc_f733729c38de, sha256 c775289da8014954ac4d1d749ba1afd3cb466fefbd26155b27db09beab464079)
BibTeX
@misc{dcf733729c38de,
title = {An extremal theorem for non-isomorphic spanning trees — arXiv:2609.30201},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30201},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f733729c38de; sha256 c775289da8014954ac4d1d749ba1afd3cb466fefbd26155b27db09beab464079},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30201. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a graph $G$, let $\tau_{\mathrm{iso}}(G)$ denote the number of isomorphism classes of its spanning trees. For every fixed $d\ge3$ and all sufficiently large $n$, we prove that every connected $n$-vertex graph $G$ with $\delta(G)\ge d$ satisfies \[\tau_{\mathrm{iso}}(G)\ge \tau_{\mathrm{iso}}(K_{d,n-d})=A_dn^{d-1}+O_d(n^{d-2}),\] for an explicit constant $A_d>0$, and $K_{d,n-d}$ is the unique minimizer. This confirms a conjecture of Bitonti, Michel and Scott and extends it to every $d\ge3$. We also show that any such graph with $O(n^{d-1})$ spanning-tree types has all but a bounded number of vertices with the same $d$ neighbours.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.30201 — 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-08T06:02:10.096Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).