Asymptotic ratio conjecture for spanning trees of suitable graphs
Let be the graph whose number of spanning trees is denoted by , and let with fixed . Define
Asymptotic ratio conjecture. The limit exists:
where . Moreover,
The conjecture proposes a limiting multiplicative growth rate for the number of spanning trees as the second graph parameter tends to infinity. The preceding numerical values suggest this behavior for and , but no proof or resolution is supplied in the source.
References
2 papers in this index state this conjecture (2017). The statement above is taken from the most recent of them; the others are arXiv:1701.08335.
Source: Maurizio Imbesi, Monica La Barbiera and Santo Saraceno, “Algorithmic releases on the spanning trees of suitable graphs”, arXiv:1704.04892 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.