ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ=(V,E)\Gamma=(\mathsf{V},\mathsf{E}) be a connected graph, let E‾\overline{\mathsf{E}} denote the relevant complementary edge set, and let nn be the number of vertices. Define

I\cT(Γ)=(mT:T∈\cT(Γ)),I_{\cT(\Gamma)}=\left(m_T:T\in\cT(\Gamma)\right),

where \cT(Γ)\cT(\Gamma) is the set of spanning trees of Γ\Gamma and mTm_T is the monomial associated to TT. Let m=(x1,…,xn)\mathfrak{m}=(x_1,\ldots,x_n). Spanning-tree formula conjecture. If ∣E‾∣≥n−2|\overline{\mathsf{E}}|\geq n-2, then

\fittWΓ=I\cT(Γ)⋅m∣E‾∣−n+2.\fitt W_\Gamma=I_{\cT(\Gamma)}\cdot\mathfrak{m}^{|\overline{\mathsf{E}}|-n+2}.

This is presented as a strengthening of the minimal-component conjecture under the stated edge-count hypothesis; its general validity is not established in the supplied text.

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.