Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,268,577 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Cactus graph
Dual graph
Dual matroid
Eulerian matroid
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Covering vectors by spaces: Regular matroids
F. Fomin
,
P. Golovach
,
D. Lokshtanov
,
Saket Saurabh
International Colloquium on Automata, Languages…
2017
Corpus ID: 6634054
Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic…
Expand
2010
2010
Decomposition of Binary Signed-Graphic Matroids
K. Papalamprou
,
L. Pitsoulis
SIAM Journal on Discrete Mathematics
2010
Corpus ID: 3001643
In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed…
Expand
2000
2000
Connected Hyperplanes in Binary Matroids
J. McNulty
,
Haidong Wu
Journal of combinatorial theory. Series B (Print)
2000
Corpus ID: 35256927
In this paper, we prove that any simple and cosimple connected binary matroid has at least four connected hyperplanes. We further…
Expand
1999
1999
Removable Circuits in Binary Matroids
Luis A. Goddyn
,
B. Jackson
Combinatorics, probability & computing
1999
Corpus ID: 16966431
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…
Expand
Highly Cited
1990
Highly Cited
1990
Matroid representations and free arrangements
G. Ziegler
1990
Corpus ID: 18038857
We show that Terao's Conjecture («Freeness of the module of logarithmic forms at a hyperplane arrangement is determined by its…
Expand
1989
1989
On Tutte Polynomials of Matroids Representable Over GF(q)
F. Jaeger
European journal of combinatorics (Print)
1989
Corpus ID: 6900310
1988
1988
Matroidal bijections between graphs
N. Linial
,
R. Meshulam
,
M. Tarsi
Journal of combinatorial theory. Series B (Print)
1988
Corpus ID: 399792
1985
1985
Decomposition of binary matroids
J. Dawson
Comb.
1985
Corpus ID: 33805916
We prove results relating to the decomposition of a binary matroid, including its uniqueness when the matroid is cosimple. We…
Expand
Highly Cited
1981
Highly Cited
1981
Local complementation and interlacement graphs
H. D. Fraysseix
Discrete Mathematics
1981
Corpus ID: 33080014
1977
1977
Kuratowski's and Wagner's theorems for matroids
R. Bixby
Journal of combinatorial theory. Series B (Print)
1977
Corpus ID: 5512820
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE