Spanning-tree formula conjecture for the Fitting ideal of a graph
Statement
Let be a connected graph, let denote the relevant complementary edge set, and let be the number of vertices. Define
where is the set of spanning trees of and is the monomial associated to . Let . Spanning-tree formula conjecture. If , then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.