Counting bases of representable matroids
From MaRDI portal
Publication:1953352
zbMath1267.05058MaRDI QIDQ1953352
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i4p41
Combinatorics in computer science (68R05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (5)
Parameterized counting of trees, forests and matroid bases ⋮ Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids ⋮ Pfaffian pairs and parities: counting on linear matroid intersection and parity problems ⋮ Approximately counting bases of bicircular matroids ⋮ Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
This page was built for publication: Counting bases of representable matroids
