3 problems

Let $G$ be a graph, and let an activity be a rule assigning active edges to spanning trees and describing the Tutte polynomial. Suppose it satisfies Crapo's property, namely that t…

Let $G$ be a graph with a standard edge, and let $\psi$ be a strongly Tutte-descriptive activity. Inactive-edge conjecture. There exists an edge $e$ of $G$ that is active in no spa…

Let $G$ be a graph. An activity is strongly Tutte-descriptive if it is Tutte-descriptive and induces a partition … A decision tree $\Delta$ is the recursive edge-labeled structure…