The Tutte polynomial modulo a prime

AJ Goodall

Research output: Contribution to journalArticle (Academic Journal)peer-review


For F_p the field on prime number p > 3 elements, it has been conjectured that there are just p + 3 evaluations of the Tutte polynomial in F_p which are computable in polynomial time. In this note it is shown that if p not equivalent to -1 mod 12 then there are further polynomial-time computable evaluations. (C) 2003 Elsevier Inc. All rights reserved.
Translated title of the contributionThe Tutte polynomial modulo a prime
Original languageEnglish
Pages (from-to)293 - 298
Number of pages6
JournalAdvances in Applied Mathematics
Volume32 (1-2)
Publication statusPublished - Jan 2004

Bibliographical note

Publisher: Academic Press Inc Elsevier Science
Other identifier: IDS Number: 757LV


Dive into the research topics of 'The Tutte polynomial modulo a prime'. Together they form a unique fingerprint.

Cite this