Around matrix-tree theorem
Abstract
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system Dn (the classical theorem corresponds to the An-case). Several byproducts of the developed technique, such as a new formula for a specialization of the multivariate Tutte polynomial, are of independent interest.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.