Abstract | ||
---|---|---|
It is well known that a rank-r matroid M is uniquely determined by its circuits of size at most r. This paper proves that if M is binary and r >= 3, then M is uniquely determined by its circuits of size at most r - 1 unless M is a binary spike or a special restriction thereof. In the exceptional cases, M is determined up to isomorphism. |
Year | Venue | Keywords |
---|---|---|
2016 | ELECTRONIC JOURNAL OF COMBINATORICS | binary matroids,circuit-hyperplane relaxations |
Field | DocType | Volume |
Matroid,Discrete mathematics,Combinatorics,Isomorphism,Electronic circuit,Binary matroid,Mathematics,Binary number | Journal | 23 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
James Oxley | 1 | 397 | 57.57 |
Charles Semple | 2 | 432 | 47.99 |
Geoff Whittle | 3 | 471 | 57.57 |