ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Jn,mJ_{n,m} be the graph whose number of spanning trees is denoted by sigma(Jn,m)sigma(J_{n,m}), and let n,meinNn,m ein\mathbb{N} with fixed n≥2n\geq 2. Define

an,m=σ(Jn,m+1)σ(Jn,m).a_{n,m}=\frac{\sigma(J_{n,m+1})}{\sigma(J_{n,m})}.

Asymptotic ratio conjecture. The limit exists:

lim⁡m→+∞an,m=δn,\lim_{m\to +\infty}a_{n,m}=\delta_n,

where δn∈R\delta_n\in\mathbb{R}. Moreover,

σ(Jn,m)=(δn)m−3σ(Jn,3).\sigma(J_{n,m})=(\delta_n)^{m-3}\sigma(J_{n,3}).

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 n=2n=2 and n=3n=3, but no proof or resolution is supplied in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.