Counting Bases of Representable Matroids

DOI: https://doi.org/10.37236/2396

Keywords: matroid bases, #P complete, complexity

We show that it is #P-complete to count the number of bases of matroids representable over a fixed infinite field or fields of fixed characteristic.

Published

2012-12-13

How to Cite

Snook, M. (2012). Counting Bases of Representable Matroids. The Electronic Journal of Combinatorics, 19(4), P41. https://doi.org/10.37236/2396

Download Citation

Issue

Article Number

P41