Atlas home || Conferences | Abstracts | about Atlas

25th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing
December 4-8, 2000
University of Canterbury
Christchurch, New Zealand

Organizers
Charles Semple, Mike Steel

View Abstracts
Conference Homepage

Martin Type polynomials of Graphs and Matroids
by
Eunice Mphako

This talk considers the problem of enumarating circuit and cocircuit partitions of matroids. This generalises a problem for graphs. The total number of circuit partitions of Eulerian binary matroids and the total number of cocircuit partitions of binary bipartite matroids will be expressed in terms of the sum of certain coefficients of the Tutte polynomial of a related structure.

Date received: November 5, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafn-30.