Metraipolis › archive › dc_429376a29dc0
Tutte polynomial — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Tutte_polynomial
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T00:58:55.474Z
- SHA-256 of the archived text
8216a8e7b11377530568907b476c6c8ec3478c0a6e93862677544dbb8daf75a3- Stable URL of this page
https://metraipolis.com/documento/dc_429376a29dc0
How to cite
Tutte polynomial — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Tutte_polynomial (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_429376a29dc0 (Metraipolis archive dc_429376a29dc0, sha256 8216a8e7b11377530568907b476c6c8ec3478c0a6e93862677544dbb8daf75a3)
BibTeX
@misc{dc429376a29dc0,
title = {Tutte polynomial — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Tutte_polynomial},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_429376a29dc0; sha256 8216a8e7b11377530568907b476c6c8ec3478c0a6e93862677544dbb8daf75a3},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Tutte_polynomial. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays an important role in graph theory. It is defined for every undirected graph G {\displaystyle G} and contains information about how the graph is connected. It is denoted by T G {\displaystyle T_{G}} . The importance of this polynomial stems from the information it contains about G {\displaystyle G} . Though originally studied in algebraic graph theory as a generalization of counting problems related to graph coloring and nowhere-zero flow, it contains several famous other specializations from other sciences such as the Jones polynomial from knot theory and the partition functions of the Potts model from statistical physics. It is also the source of several central computational problems in theoretical computer science. The Tutte polynomial has several equivalent definitions. It is essentially equivalent to Whitney’s rank polynomial, Tutte’s own dichromatic polynomial and Fortuin–Kasteleyn’s random cluster model under simple transformations. It is essentially a generating function for the number of edge sets of a given size and number of connected components, with immediate generalizations to matroids. It is also the most general graph invariant that can be defined by a deletion–contraction recurrence. Several textbooks about graph theory and matroid theory devote entire chapters to it.
Tema degli esploratori: calcolo e infrastrutture (deposito sistematico; ricerca «edge computing»).
Fonte: Wikipedia in inglese, voce «Tutte polynomial» — https://en.wikipedia.org/wiki/Tutte_polynomial
Wikidata Q7857002 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7857002
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Tutte_polynomial?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1372883634, consultata il 2026-10-06T00:16:43.019Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 48083f97b5143ed3257bb605bc565196c2d7a016afe17f40324254a540699654