Spanning trees and a conjecture of Kontsevich
Richard P. Stanley
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.
Create a lesson
Related papers
2-large sets are sets of nil-Bohr recurrence
Ryan Alweiss, Sohail Farhangi
New tools for sparse graph embeddings: Hybrid expanders and application to nested cycles
Nemanja Draganić
Edge and spectral conditions for rainbow bipancyclicity in bipartite graph collections
Lihua You, Xiaoxue Zhang, Xinghui Zhao
The rich-neighbor chromatic index is linear in the maximum degree
Masaki Kashima, Mirko Petruševski, Jelena Sedlar et al.
The (km,kn)-square paths theorem
Dun Qiu, Minhao Zhang
Towards a Sum-of-Squares Proof for the Nonexistence of Conway's 99-graph
Joseph Natal, Oleksiy Al-saadi