Unrefereed research note, 17 November 2026. See proof.pdf for the original three-page typeset manuscript and its embedded verifier. Notation follows Ethan Y. H. Li, A quantitative way to e-positivity of trees, Section 4.
Statement
There exists a tree T of order 31, maximum degree 4, and all 6,842 connected partition types, such that
The tree is neither a spider nor a caterpillar and its unique degree-4 vertex has only one leaf neighbor. Therefore the sign assertion in Li's Problem 4.9, the first question in Problem 4.6, and the informal uniqueness prediction preceding Problem 4.6 all fail in the non-spider class.
Construction
Use vertices 0,...,30. Consecutive vertices on each of the paths below are adjacent:
(0,1);(0,2,3);(0,4,5,6,7,8,9,10,11,12,13,14);(8,15);(0,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30).
These paths give exactly 30 edges and form a connected acyclic graph. The only vertices of degree greater than two are 0 (degree 4) and 8 (degree 3), so this tree is not a spider. Its leaf neighbors of vertex 0 are exactly {1}. After removing all leaves, vertex 0 still has three neighbors, so the tree is not a caterpillar either.
All connected partition types
For a tree, a connected vertex partition is uniquely specified by the set of edges cut between blocks. Root at 0. For each processed rooted subtree, record (a, lambda), where a is the size of the component containing its root and lambda records the sizes of all finished components.
A leaf contributes (1,()). For parent state (a,lambda) and child state (b,mu), there are two possibilities:
- Keep the edge:
(a+b, lambda \uplus mu). - Cut the edge:
(a, lambda \uplus mu \uplus (b)).
Multiply state multiplicities when merging. This is a bijective decomposition of edge subsets, so the recurrence computes exact connected-partition counts by induction. At the root, add a to the multiset of finished component sizes.
The provided standard-library Python verifier checks that the total of multiplicities is 2^30=1,073,741,824, that the support contains every one of the p(31)=6,842 integer partitions of 31, and that for each type a saved edge-mask witness independently reconstructs the required component sizes. Thus T has every connected partition type.
For lambda=(3,2^14), the triple can be exactly one of
In each case its deletion leaves a forest with a perfect matching. A forest has at most one perfect matching, because each leaf must match its unique neighbor; repeated forced-leaf removal determines the matching. The verifier checks all triples and obtains b_(3,2^14)=8.
Exact elementary coefficient
Take the three-variable specialization, modulo t^2,
Then e_1=0, e_2=-1 modulo t^2, e_3=t modulo t^2, and e_j=0 for j>3. By homogeneity (degree 31), the coefficient of t in X_T equals [e_3e_2^{14}]X_T: the other elementary products are either zero or involve t^2, and the sign (-1)^14 is positive.
The bipartition by parity of distance from 0 has 16 odd-distance vertices (A) and 15 even-distance vertices (B). The two proper colorings with only colors 1 and 2 contribute -t modulo t^2.
If exactly one vertex v has color 3, remove that vertex and color each component of T-v using colors 1 and 2. Its contributions cancel whenever any component has odd order. If all components have even order, the contribution is +2^{deg(v)} t for v in A and -2^{deg(v)} t for v in B.
The qualifying vertices, grouped by bipartition and degree, are:
| Class | Vertices | Coefficient contribution |
|---|---|---|
A, degree 1 |
1, 14, 30 |
+6 |
A, degree 2 |
10, 12, 16, 18, 20, 22, 24, 26, 28 |
+36 |
B, degree 1 |
3, 15 |
-4 |
B, degree 2 |
5, 7 |
-8 |
Therefore
The separate independent_check.py computes these qualifying vertices from the explicit tree by connected-component parity after each vertex deletion. The original verify.py also computes all five coefficients in the subalgebra generated by e_2,e_3, using the power-sum edge-cut expansion, and checks five exact three-color evaluations. In particular, it verifies [e_2^8 e_3^5]X_T=-6304.
Scope
The result falsifies Li's coefficient-sign prediction and first two-leaf condition, not Dahlberg--She--van Willigenburg's general non-e-positivity conjecture. The latter is consistent with T since an elementary coefficient is negative.
The unrestricted forms of Li's expectations already have earlier spider counterexamples. Hor'ak--Wo'zniak's earlier arbitrarily vertex-decomposable spider with arm orders (2,3,13,16) has order 31, a single degree-4 vertex adjacent to only one leaf, and (using Zheng's coefficient formula) coefficient +7. Our result concerns the non-spider class singled out by Li. See NOVELTY.md. No priority or peer-review claim is made.