Determining a Binary Matroid from its Small Circuits
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\ge 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.
Keyword(s):
2014 ◽
Vol 07
(04)
◽
pp. 1450060
1998 ◽
Vol 184
(1-3)
◽
pp. 267-271
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):