Added a comment.

poly-form.tex

@@ -214,6 +214,8 @@ Then $\numocc{\tri}_2 = 0$, and if we can prove that
 we solve our problem for $q_E^3$ based on $G_2$ and we can compute $\numocc{\threedis}$, a hard problem.
 \end{proof}
 
+\AH{Proving the above linear combination for 3-matchings in $G_2$ always holds for an arbitrary $G_1$.}
+
 Consider graph $G_2$, constructed from an arbitrary graph $G_1$.  We wish to show that the number of 3-matchings in $G_2$ will always be the linear combination above, regardless of the construction of $G_1$.
 
 \begin{proof}