Statements (33)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algebra
gptkb:graph_invariant |
| gptkbp:application |
knot theory
statistical physics network reliability enumerative combinatorics |
| gptkbp:complexity |
#P-hard
|
| gptkbp:definedIn |
graphs
matroids |
| gptkbp:field |
matroid theory
graph theory |
| gptkbp:generalizes |
gptkb:Jones_polynomial
chromatic polynomial flow polynomial |
| gptkbp:hasSpecialCase |
gptkb:Jones_polynomial
chromatic polynomial flow polynomial reliability polynomial |
| gptkbp:introducedIn |
1947
|
| gptkbp:namedAfter |
gptkb:W._T._Tutte
|
| gptkbp:notation |
T(G; x, y)
|
| gptkbp:property |
deletion-contraction recurrence
invariant under graph isomorphism |
| gptkbp:relatedTo |
gptkb:Potts_model
partition function |
| gptkbp:satisfies |
T(G; x, y) = x*T(G/e; x, y) for bridge e
T(G; x, y) = T(G\e; x, y) + T(G/e; x, y) for non-loop, non-bridge edge e T(G; x, y) = y*T(G\e; x, y) for loop e |
| gptkbp:variant |
x
y |
| gptkbp:bfsParent |
gptkb:Bill_Tutte
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Tutte polynomial
|