Spanning trees and a conjecture of Kontsevich

From MaRDI portal
Publication:1293422

DOI10.1007/BF01608530zbMATH Open0927.05087arXivmath/9806055WikidataQ123259384 ScholiaQ123259384MaRDI QIDQ1293422FDOQ1293422

Richard P. Stanley

Publication date: 28 June 1999

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/9806055




Recommendations




Cites Work


Cited In (20)





This page was built for publication: Spanning trees and a conjecture of Kontsevich

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293422)