Skip to search formSkip to main contentSkip to account menu

Binary matroid

In matroid theory, a binary matroid is a matroid that can be represented over the finite field GF(2). That is, up to isomorphism, they are the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic… 
2010
2010
In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed… 
2000
2000
In this paper, we prove that any simple and cosimple connected binary matroid has at least four connected hyperplanes. We further… 
1999
1999
We show that, if M is a connected binary matroid of cogirth at least five which does not have both an F7-minor and an F*7-minor… 
Highly Cited
1990
Highly Cited
1990
We show that Terao's Conjecture («Freeness of the module of logarithmic forms at a hyperplane arrangement is determined by its… 
1989
1989
  • F. Jaeger
  • 1989
  • Corpus ID: 6900310
1988
1988
1985
1985
We prove results relating to the decomposition of a binary matroid, including its uniqueness when the matroid is cosimple. We… 
Highly Cited
1981
1977
1977
  • R. Bixby
  • 1977
  • Corpus ID: 5512820