Name
Abstract | ||
|---|---|---|
The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit–cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a finite field k if and only if all its finite minors are representable over k. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jctb.2017.08.004 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Matroid,Infinite Matroid,Tree-decomposition,Representable,Rota's Conjecture,Minor,Tutte-decomposition,Thin sums,Ends | Matroid,Discrete mathematics,Combinatorics,Matroid partitioning,Graphic matroid,Mathematics,Binary number | Journal |
Volume | ISSN | Citations |
128 | 0095-8956 | 6 |
PageRank | References | Authors |
0.87 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathan Bowler | 1 | 16 | 6.83 |
| Johannes Carmesin | 2 | 29 | 7.08 |