The size of the spanning-tree spectrum of simple graphs
International Mathematics Research Notices · 25.11.2026 · 2026 (22)
DOI: 10.1093/imrn/rnag281 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Mathematics Research Notices, online erschienen am 18.11.2026. Verfasst von Vishesh Jain. Die Arbeit nennt 19 Literaturangaben.
Abstract (Originalsprache)
For a graph $G$, let $\tau (G)$ denote the number of its spanning trees. We show that for every fixed $0 < c < 1/4$, the number of distinct values of $\tau (G)$, as $G$ ranges over simple graphs on $n$ vertices, is at least $\exp (c n \log n)$ for all sufficiently large $n$. This is optimal up to the choice of the constant $c$ and resolves a conjecture of Chan–Kontorovich–Pak regarding a problem of Sedláček from the late 1960s.
Zitieren
APA
Jain, V. (2026). The size of the spanning-tree spectrum of simple graphs. International Mathematics Research Notices, 2026(22). https://doi.org/10.1093/imrn/rnag281
Vancouver
Jain V. The size of the spanning-tree spectrum of simple graphs. International Mathematics Research Notices. 2026;2026(22). doi:10.1093/imrn/rnag281
BibTeX
@article{Jain2026,
author = {Jain, Vishesh},
title = {The size of the spanning-tree spectrum of simple graphs},
journal = {International Mathematics Research Notices},
year = {2026},
volume = {2026},
number = {22},
doi = {10.1093/imrn/rnag281}
}
EUVIMED