Defines the (n-2,2) component of the S_n-representation of the graph element X_G, derives its edge-space model and trace moments in terms of support-forest counts, and proves that a weighted trace polynomial reconstructs all trees from the second moment except for one exceptional n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The (n-2,2)-Spectrum of a Graph
Defines the (n-2,2) component of the S_n-representation of the graph element X_G, derives its edge-space model and trace moments in terms of support-forest counts, and proves that a weighted trace polynomial reconstructs all trees from the second moment except for one exceptional n.