ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mm be the number of marked vertices in a graph. A quadratic spanning forest identity of the indicated type has coefficients as free variables, where the left-hand side consists of a spanning tree and a spanning forest with each marked vertex in a different tree, and the right-hand side consists of pairs of spanning forests partitioning the marked vertices between two and between m−1m-1 trees. Vlasev–Yeats conjecture. The formulae for quadratic spanning forest identities of this type on mm marked vertices have m(m−2)m(m-2) free variables. This conjecture generalizes the known 4-vertex identity, which has eight free variables; the paper subsequently gives a formal vector-space formulation and verifies the count in the cases discussed, while the general assertion is presented as a conjecture.

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.