Spanning trees and a conjecture of Kontsevich
| dc.creator | Stanley, Richard P. | |
| dc.date | 1998-06-10 | |
| dc.date | 1998-11-09 | |
| dc.date.accessioned | 2026-07-07T05:24:59Z | |
| dc.date.available | 2026-07-07T05:24:59Z | |
| dc.description | 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. | |
| dc.description | 18 pages. This version corrects some minor inaccuracies and adds some computational information provided by John Stembridge | |
| dc.identifier | https://arxiv.org/abs/math/9806055 | |
| dc.identifier | http://arxiv.org/abs/math/9806055 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/77026 | |
| dc.subject | Combinatorics | |
| dc.subject | Algebraic Geometry | |
| dc.subject | Rings and Algebras | |
| dc.subject | 05E99 (Primary) 11T41 (Secondary) | |
| dc.title | Spanning trees and a conjecture of Kontsevich | |
| dc.type | text |