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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2016
0519772016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We consider the problem of approximating certain combinatorial polynomials. First, we consider the problem of approximating the… (More)
Is this relevant?
2012
2012
We prove that if N is an internally 4-connected proper minor of a weakly 4-connected binary matroid M with |E(N)| ≥ 7, then… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
1. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following. A… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2004
2004
Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1997
1997
We show that if M is a connected binary matroid of cogirth at least ve which does not have both an F 7-minor and an F 7-minor… (More)
Is this relevant?
1994
1994
In this paper we present an algorithm that extends previous research in two distinct fields matroid theory and computational… (More)
  • figure 1
  • figure 2
Is this relevant?
1987
1987
The cycle matroids of wheels are the fundamental building blocks for the class of binary matroids. Brylawski has shown that a… (More)
  • figure 1
Is this relevant?
1987
1987
Given a simple graph G having vertex set V, it is obvious that for any spanning tree T, there is an edge of Twhose fundamental… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1987
1987
A family of subsets of a ground set closed under the operation of taking symmetric differences is the family of cycles of a… (More)
  • figure 1
  • figure 2
Is this relevant?
1986
1986
Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravarti and Robertson solved the… (More)
Is this relevant?