Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,393,514 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.
2016
2016
Dense PG(n-1,2)-free binary matroids
Rutger Campbell
2016
Corpus ID: 119140534
For each integer $n \geq 2$, we prove that, if $M$ is a simple rank-$r$ $PG(n-1,2)$-free binary matroid with $|M|>\left(1-\frac{3…
Expand
2015
2015
On the structure of dense triangle-free binary matroids
Rutger Campbell
,
J. Geelen
,
P. Nelson
2015
Corpus ID: 119137525
We prove, by means of an exact structural description, that every simple triangle-free binary matroid $M$ with $|M| > \tfrac{33…
Expand
2013
2013
Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
B. Guenin
,
Leanne Stuive
Conference on Integer Programming and…
2013
Corpus ID: 36374082
Consider a binary matroid M given by its matrix representation. We show that if M is a lift of a graphic or a co-graphic matroid…
Expand
2012
2012
Strong Splitter Theorem
S. Kingan
,
Manoel Lemos
2012
Corpus ID: 119153091
The Splitter Theorem states that, if N is a 3-connected proper minor of a 3-connected matroid M such that, if N is a wheel or…
Expand
2009
2009
Local equivalence, surface-code states, and matroids
P. Sarvepalli
,
R. Raussendorf
2009
Corpus ID: 115178598
Recently, Ji et al. disproved the local-unitary-local Clifford (LU-LC) conjecture and showed that the local unitary (LU) and…
Expand
2006
2006
Matroid algorithm for monitorability analysis of bond graphs
H. Haffaf
,
B. O. Bouamama
,
G. Dauphin-Tanguy
Journal of the Franklin Institute
2006
Corpus ID: 46948203
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
1994
1994
Learning binary matroid ports
L. Hellerstein
,
Collette R. Coullard
ACM-SIAM Symposium on Discrete Algorithms
1994
Corpus ID: 12563099
Given a binary matroid M specified by a port oracle, we can in polynomial number of calls to the oracle construct a binary…
Expand
1990
1990
A proof of McKee's eulerian-bipartite characterization
D. R. Woodall
Discrete Mathematics
1990
Corpus ID: 34977861
1967
1967
On even matroids
W. T. Tutte
1967
Corpus ID: 124115127
It is s hown in [1] I that e very graphic matroid is regular ([1], 5.63) and even ([IJ, 9.23). Moreover a regular matroid c an be…
Expand
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