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.
2016
2016
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… 
2015
2015
We prove, by means of an exact structural description, that every simple triangle-free binary matroid $M$ with $|M| > \tfrac{33… 
2013
2013
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… 
2012
2012
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… 
2009
2009
Recently, Ji et al. disproved the local-unitary-local Clifford (LU-LC) conjecture and showed that the local unitary (LU) and… 
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… 
1994
1994
Given a binary matroid M specified by a port oracle, we can in polynomial number of calls to the oracle construct a binary… 
1967
1967
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…