Abstract | ||
---|---|---|
We describe the computation of a catalogue containing all matroids with up to nine elements, and present some fundamental data arising from this catalogue. Our computation confirms and extends the results obtained in the 1960s by Blackburn, Crapo and Higgs. The matroids and associated data are stored in an on-line database, and we give three short examples of the use of this database. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1016/j.jctb.2007.07.005 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
orderly algorithm,matroid,extension,fundamental data,combinatorial geometry,on-line database,short example | Discrete geometry,Matroid,Discrete mathematics,Combinatorics,Higgs boson,Graphic matroid,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
98 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
12 | 0.83 | 4 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dillon Mayhew | 1 | 102 | 18.63 |
Gordon F. Royle | 2 | 159 | 29.85 |