Thesis
The complexity of graph polynomials
- Abstract:
-
This thesis examines graph polynomials and particularly their complexity. We give short proofs of two results from Gessel and Sagan (1996) which present new evaluations of the Tutte polynomial concerning orientations. A theorem of Massey et al (1997) gives an expression concerning the average size of a forest in a graph. We generalise this result to any simplicial complex. We answer a question posed by Kleinschmidt and Onn (1995) by showing that the language of partitionable simplicial com...
Expand abstract
Actions
Funding
Bibliographic Details
- Publication date:
- 1997
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:c84702b4-b371-474b-a003-4d24f25e5a12
- Local pid:
- ora:5079
- Deposit date:
- 2011-03-04
If you are the owner of this record, you can report an update to it here: Report update to this record