Spanning trees and a conjecture of Kontsevich

Details Spanning trees and a conjecture of Kontsevich Spanning trees and a conjecture of Kontsevich

1998-06-10

arxiv.org/abs/math/9806055v3

Mathematics

Combinatorics

18 pages. This version corrects some minor inaccuracies and adds some computational information provided by John Stembridge

Scientific paper

Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's conjecture. However, we can evaluate f(G,q) explicitly for certain graphs G, such as the complete graph. We also point out the connection between Kontsevich's conjecture and such topics as the Matrix-Tree Theorem and orthogonal geometry.

Affiliated with

Also associated with

No associations

Rating

Spanning trees and a conjecture of Kontsevich does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spanning trees and a conjecture of Kontsevich, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spanning trees and a conjecture of Kontsevich will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611650