ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n,d≥3n,d\geq 3 be integers, and let GG be a connected nn-vertex dd-regular graph. Write Tunlabeled(G)T_{\mathrm{unlabeled}}(G) for the set of isomorphism classes of spanning trees of GG. Exponential spanning-tree conjecture. There exists a universal constant c>0c>0 depending only on dd such that

∣Tunlabeled(G)∣≥ecn.|T_{\mathrm{unlabeled}}(G)|\geq e^{cn}.

The paper proves an analogous result for sufficiently large degree and asks whether the threshold can be reduced to d0=3d_0=3; the conjecture asserts this bound for every d≥3d\geq3.

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.